Alex K. Simpson

28 papers A* 6B 4C 1Journal 9Unranked 7
YearRankTypeTitle / Venue / Authors
2015 J jnl
Łukasiewicz μ-calculus.
CoRR
Matteo Mio, Alex K. Simpson
2012 J jnl
Constructive toposes with countable sums as models of constructive set theory.
Ann. Pure Appl. Log.
Alex K. Simpson, Thomas Streicher
2005 — conf
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics.
RTA
Alex K. Simpson
2005 C conf
Representing Probability Measures using Probabilistic Processes.
CCA
Matthias Schröder, Alex K. Simpson
2004 J jnl
Computational adequacy for recursive types in models of intuitionistic set theory.
Ann. Pure Appl. Log.
Alex K. Simpson
2004 J jnl
Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS.
J. Log. Algebraic Methods Program.
Alex K. Simpson
2003 J jnl
An equational notion of lifting monad.
Theor. Comput. Sci.
Anna Bucalo, Carsten Führmann, Alex K. Simpson
2002 A* conf
Comparing Functional Paradigms for Exact Real-Number Computation.
ICALP
Andrej Bauer, Martín Hötzel Escardó, Alex K. Simpson
2002 A* conf
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory.
LICS
Alex K. Simpson
2002 J jnl
Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces.
Math. Struct. Comput. Sci.
Matías Menni, Alex K. Simpson
2002 B conf
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes.
FoSSaCS
Ulrich Schöpp, Alex K. Simpson
2001 A* conf
A Universal Characterization of the Closed Euclidean Interval.
LICS
Martín Hötzel Escardó, Alex K. Simpson
2000 J jnl
Axioms and (counter) examples in synthetic domain theory.
Ann. Pure Appl. Log.
Jaap van Oosten, Alex K. Simpson
2000 A* conf
Complete Axioms for Categorical Fixed-Point Operators.
LICS
Alex K. Simpson, Gordon D. Plotkin
1999 A* conf
Elementary Axioms for Categories of Classes.
LICS
Alex K. Simpson
1999 — conf
Equational Lifting Monads.
CTCS
Anna Bucalo, Carsten Führmann, Alex K. Simpson
1999 — conf
Lambda Definability with Sums via Grothendieck Logical Relations.
TLCA
Marcelo P. Fiore, Alex K. Simpson
1999 B conf
The Largest Topological Subcategory of Countably-based Equilogical Spaces.
MFPS
Matías Menni, Alex K. Simpson
1998 B conf
Computational Adequacy in an Elementary Topos.
CSL
Alex K. Simpson
1998 B conf
Lazy Functional Algorithms for Exact Real Functionals.
MFCS
Alex K. Simpson
1998 — conf
Some axiomatic results in synthetic domain theory.
Workshop on Domains
Jaap van Oosten, Alex K. Simpson
1997 J jnl
A Uniform Approach to Domain Theory in Realizability Models.
Math. Struct. Comput. Sci.
John R. Longley, Alex K. Simpson
1995 — conf
Categorical completeness results for the simply-typed lambda-calculus.
TLCA
Alex K. Simpson
1995 A* conf
Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS
LICS
Alex K. Simpson
1995 — conf
The Convex Powerdomain in a Category of Posets Realized by CPOs.
Category Theory and Computer Science
Alex K. Simpson
1994 — —
The proof theory and semantics of intuitionistic modal logic.
Alex K. Simpson
1993 J jnl
A Characterisation of the Least-Fixed-Point Operator by Dinaturality.
Theor. Comput. Sci.
Alex K. Simpson
1992 — conf
Hierarchical Meta-Logics: Intuitions, Proof Theory and Semantics.
META
Fausto Giunchiglia, Luciano Serafini, Alex K. Simpson