Alex K. Simpson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2012

Constructive toposes with countable sums as models of constructive set theoryAlex K. Simpson, Thomas Streicher. APAL, 163(10):1419-1436, 2012. [doi]

2005

Representing Probability Measures using Probabilistic ProcessesMatthias Schröder, Alex K. Simpson. cca 2005: 211-226

Reduction in a Linear Lambda-Calculus with Applications to Operational SemanticsAlex K. Simpson. RTA 2005: 219-234 [doi]

2004

Computational adequacy for recursive types in models of intuitionistic set theoryAlex K. Simpson. APAL, 130(1-3):207-275, 2004. [doi]

Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOSAlex K. Simpson. jlp, 60-61:287-322, 2004. [doi]

2003

An equational notion of lifting monadAnna Bucalo, Carsten Führmann, Alex K. Simpson. TCS, 294(1/2):31-60, 2003.

2002

Comparing Functional Paradigms for Exact Real-Number ComputationAndrej Bauer, Martín Hötzel Escardó, Alex K. Simpson. icalp 2002: 488-500 [doi]

Topological and Limit-Space Subcategories of Countably-Based Equilogical SpacesMatías Menni, Alex K. Simpson. mscs, 12(6):739-770, 2002.

Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free ProcessesUlrich Schöpp, Alex K. Simpson. fossacs 2002: 372-386 [doi]

Computational Adequacy for Recursive Types in Models of Intuitionistic Set TheoryAlex K. Simpson. lics 2002: 287-298 [doi]

2001

A Universal Characterization of the Closed Euclidean IntervalMartín Hötzel Escardó, Alex K. Simpson. lics 2001: 115-128

2000

Complete Axioms for Categorical Fixed-Point OperatorsAlex K. Simpson, Gordon D. Plotkin. lics 2000: 30-41 [doi]

Some axiomatic results in synthetic domain theoryJaap van Oosten, Alex K. Simpson. ENTCS, 35:175, 2000. [doi]

Axioms and (counter) examples in synthetic domain theoryJaap van Oosten, Alex K. Simpson. APAL, 104(1-3):233-278, 2000.

1999

1998

Lazy Functional Algorithms for Exact Real FunctionalsAlex K. Simpson. mfcs 1998: 456-464 [doi]

Computational Adequacy in an Elementary ToposAlex K. Simpson. csl 1999: 323-342

1997

A Uniform Approach to Domain Theory in Realizability ModelsJohn R. Longley, Alex K. Simpson. mscs, 7(5):469-505, 1997.

1995

The Convex Powerdomain in a Category of Posets Realized by CPOsAlex K. Simpson. ctcs 1995: 117-145

Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOSAlex K. Simpson. lics 1995: 420-430

Categorical completeness results for the simply-typed lambda-calculusAlex K. Simpson. tlca 1995: 414-427

1994

The proof theory and semantics of intuitionistic modal logicAlex K. Simpson. PhD thesis, University of Edinburgh, UK, 1994. [doi]

1993

A Characterisation of the Least-Fixed-Point Operator by DinaturalityAlex K. Simpson. TCS, 118(2):301-314, 1993.

1992

Hierarchical Meta-Logics: Intuitions, Proof Theory and SemanticsFausto Giunchiglia, Luciano Serafini, Alex K. Simpson. meta 1992: 235-249

Sign in or sign up to see more results.

runs on WebDSL