Hierarchical Meta-Logics: Intuitions, Proof Theory and Semantics. - Fausto Giunchiglia; Luciano Serafini; Alex K. Simpson (META, 1992)

A Characterisation of the Least-Fixed-Point Operator by Dinaturality. - Alex K. Simpson (Theor. Comput. Sci., 1993)

The proof theory and semantics of intuitionistic modal logic. - Alex K. Simpson (1994)

The Convex Powerdomain in a Category of Posets Realized by CPOs. - Alex K. Simpson (Category Theory and Computer Science, 1995)

Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS - Alex K. Simpson (LICS, 1995)

Categorical completeness results for the simply-typed lambda-calculus. - Alex K. Simpson (TLCA, 1995)

A Uniform Approach to Domain Theory in Realizability Models. - John R. Longley; Alex K. Simpson (Math. Struct. Comput. Sci., 1997)

Computational Adequacy in an Elementary Topos. - Alex K. Simpson (CSL, 1998)

Lazy Functional Algorithms for Exact Real Functionals. - Alex K. Simpson (MFCS, 1998)

Some axiomatic results in synthetic domain theory. - Jaap van Oosten; Alex K. Simpson (Workshop on Domains, 1998)

Elementary Axioms for Categories of Classes. - Alex K. Simpson (LICS, 1999)

Lambda Definability with Sums via Grothendieck Logical Relations. - Marcelo P. Fiore; Alex K. Simpson (TLCA, 1999)

The Largest Topological Subcategory of Countably-based Equilogical Spaces. - Matías Menni; Alex K. Simpson (MFPS, 1999)

Equational Lifting Monads. - Anna Bucalo; Carsten Führmann; Alex K. Simpson (CTCS, 1999)

Complete Axioms for Categorical Fixed-Point Operators. - Alex K. Simpson; Gordon D. Plotkin (LICS, 2000)

Axioms and (counter) examples in synthetic domain theory. - Jaap van Oosten; Alex K. Simpson (Ann. Pure Appl. Log., 2000)

A Universal Characterization of the Closed Euclidean Interval. - Martín Hötzel Escardó; Alex K. Simpson (LICS, 2001)

Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. - Ulrich Schöpp; Alex K. Simpson (FoSSaCS, 2002)

Comparing Functional Paradigms for Exact Real-Number Computation. - Andrej Bauer; Martín Hötzel Escardó; Alex K. Simpson (ICALP, 2002)

Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces. - Matías Menni; Alex K. Simpson (Math. Struct. Comput. Sci., 2002)

An equational notion of lifting monad. - Anna Bucalo; Carsten Führmann; Alex K. Simpson (Theor. Comput. Sci., 2003)

Computational adequacy for recursive types in models of intuitionistic set theory. - Alex K. Simpson (Ann. Pure Appl. Log., 2004)

Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS. - Alex K. Simpson (J. Log. Algebraic Methods Program., 2004)

Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability. - Andrej Bauer; Alex Simpson (Math. Log. Q., 2004)

Constructive Set Theories and their Category-theoretic Models. - Alex Simpson (From sets and types to topology and analysis, 2005)

Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. - Alex K. Simpson (RTA, 2005)

Probabilistic Observations and Valuations: (Extended Abstract). - Matthias Schröder 001; Alex Simpson (MFPS, 2005)

Coalgebraic semantics for timed processes. - Marco Kick; John Power; Alex Simpson (Inf. Comput., 2006)

Representing probability measures using probabilistic processes. - Matthias Schröder 001; Alex Simpson (J. Complex., 2006)

Compactly generated domain theory. - Ingo Battenfeld; Matthias Schröder 001; Alex Simpson (Math. Struct. Comput. Sci., 2006)

Complete Sequent Calculi for Induction and Infinite Descent. - James Brotherston; Alex Simpson (LICS, 2007)

A Logic for Parametric Polymorphism with Effects. - Rasmus Ejlers Møgelberg; Alex Simpson (TYPES, 2007)

Relating First-order Set Theories and Elementary Toposes. - Steven Awodey; Carsten Butz; Alex Simpson; Thomas Streicher (Bull. Symb. Log., 2007)

A Convenient Category of Domains. - Ingo Battenfeld; Matthias Schröder 001; Alex Simpson (Computation, Meaning, and Logic, 2007)

Relational Parametricity for Control Considered as a Computational Effect. - Rasmus Ejlers Møgelberg; Alex Simpson (MFPS, 2007)

Programming Languages and Operational Semantics by Fernández Maribel, King's College Publications, 2004, ISBN 0954300637. - Alex Simpson (J. Funct. Program., 2007)

Two preservation results for countable products of sequential spaces. - Matthias Schröder 001; Alex Simpson (Math. Struct. Comput. Sci., 2007)

Enriching an Effect Calculus with Linear Types. - Jeff Egger; Rasmus Ejlers Møgelberg; Alex Simpson (CSL, 2009)

Linear types for computational effects. - Alex Simpson (POPL, 2009)

Relational Parametricity for Computational Effects - Rasmus Ejlers Møgelberg; Alex Simpson (Log. Methods Comput. Sci., 2009)

Linearly-Used Continuations in the Enriched Effect Calculus. - Jeff Egger; Rasmus Ejlers Møgelberg; Alex Simpson (FoSSaCS, 2010)

A Generic Operational Metatheory for Algebraic Effects. - Patricia Johann; Alex Simpson; Janis Voigtländer (LICS, 2010)

Sequent calculi for induction and infinite descent. - James Brotherston; Alex Simpson (J. Log. Comput., 2011)

Measure, randomness and sublocales. - Alex Simpson (Ann. Pure Appl. Log., 2012)

Constructive toposes with countable sums as models of constructive set theory. - Alex K. Simpson; Thomas Streicher (Ann. Pure Appl. Log., 2012)

Linear-use CPS translations in the Enriched Effect Calculus - Jeff Egger; Rasmus Ejlers Møgelberg; Alex Simpson (Log. Methods Comput. Sci., 2012)

A Proof System for Compositional Verification of Probabilistic Concurrent Processes. - Matteo Mio; Alex Simpson (FoSSaCS, 2013)

Conditional Independence in Categories. - Alex Simpson (TACL, 2013)

Łukasiewicz mu-Calculus. - Matteo Mio; Alex Simpson (FICS, 2013)

Abstract Datatypes for Real Numbers in Type Theory. - Martín Hötzel Escardó; Alex Simpson (RTA-TLCA, 2014)

Relating first-order set theories, toposes and categories of classes. - Steven Awodey; Carsten Butz; Alex Simpson; Thomas Streicher (Ann. Pure Appl. Log., 2014)

The enriched effect calculus: syntax and semantics. - Jeff Egger; Rasmus Ejlers Møgelberg; Alex Simpson (J. Log. Comput., 2014)

Comprehensive Parametric Polymorphism: Categorical Models and Type Theory. - Neil Ghani; Fredrik Nordvall Forsberg; Alex Simpson (FoSSaCS, 2016)

Probability Sheaves and the Giry Monad. - Alex Simpson (CALCO, 2017)

Cyclic Arithmetic Is Equivalent to Peano Arithmetic. - Alex Simpson (FoSSaCS, 2017)

Łukasiewicz μ-calculus. - Matteo Mio; Alex Simpson (Fundam. Informaticae, 2017)

Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular. - Aliaume Lopez; Alex Simpson (CSL, 2018)

Category-theoretic Structure for Independence and Conditional Independence. - Alex Simpson (MFPS, 2018)

Google searches do not correlate with melanoma incidence in majority English speaking countries. - Laura McDonald; Alex Simpson; Sophie Graham; Anna Schultze; Beth Nordstrom; Piyush Durani; Faisal Mehmud; Sreeram V. Ramagopalan (npj Digit. Medicine, 2018)

Behavioural Equivalence via Modalities for Algebraic Effects. - Alex Simpson; Niels F. W. Voorneveld (ACM Trans. Program. Lang. Syst., 2020)

Equivalence and Conditional Independence in Atomic Sheaf Logic. - Alex Simpson (LICS, 2024)

An Imperative Language for Verified Exact Real-Number Computation. - Andrej Bauer; Sewon Park 001; Alex Simpson (CoRR, 2024)

Safety, Relative Tightness and the Probabilistic Frame Rule. - Janez Ignacij Jereb; Alex Simpson (CoRR, 2025)