- Constructive Toposes with Countable Sums as Models of Constructive Set Theory
- A logic for parametric polymorphism with effects Rasmus Ejlers Mgelberg and Alex Simpson
- Relational Parametricity for Computational Effects Rasmus Ejlers Mgelberg # Alex Simpson +
- GDP Festschrift ENTCS, to appear A Convenient Category of Domains
- Complete Axioms for Categorical Fixedpoint Operators Alex Simpson \Lambda and Gordon Plotkin y
- GDP Festschrift ENTCS, to appear A Convenient Category of Domains
- Coalgebraic Semantics for Timed Processes Marco Kick, John Power 1; , Alex Simpson 2
- Locally Non-compact Spaces and Continuity Principles
- mlq header will be provided by the publisher Two Constructive EmbeddingExtension Theorems
- Sequent Calculi for Process Veri cation: Hennessy-Milner Logic for
- Representing Probability Measures using Probabilistic Processes
- Comparing Functional Paradigms for Exact Realnumber Computation
- Reduction in a Linear Lambdacalculus with Applications to Operational Semantics
- Categorical completeness results for the simplytyped lambdacalculus
- The Proof Theory and Semantics of Intuitionistic Modal Logic
- The Proof Theory and Semantics of Intuitionistic Modal Logic
- Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
- Locally Non-compact Spaces and Continuity Principles
- Comparing cartesian closed categories of (core) compactly generated spaces
- Constructive Set Theories and their Category-theoretic Models
- Reduction in a Linear Lambda-calculus with Applications to Operational Semantics
- Under consideration for publication in Math. Struct. in Comp. Science Compactly Generated Domain Theory
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Complete Sequent Calculi for Induction and Infinite Descent James Brotherston
- Sequent calculi for induction and infinite descent James Brotherston
- A Generic Operational Metatheory for Algebraic Effects Patricia Johann
- LINEAR-USE CPS TRANSLATIONS IN THE ENRICHED EFFECT CALCULUS
- Verifying Temporal Properties Using Explicit Approximants
- Two Probabilistic Powerdomains in Topological Domain Theory
- Equational Lifting Monads Anna Bucalo 1 Carsten Fuhrmann 2 Alex Simpson 3
- Under consideration for publication in Math. Struct. in Comp. Science Compactly Generated Domain Theory
- Representing Probability Measures using Probabilistic Processes
- Relating first-order set theories, toposes and categories of classes
- An Equational Notion of Lifting Monad # Anna Bucalo
- Comparing Functional Paradigms for Exact Real-number Computation
- mlq header will be provided by the publisher Two Constructive Embedding-Extension Theorems
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Relational Parametricity for Computational Effects Rasmus Ejlers Mgelberg
- Verifying Temporal Properties using Explicit Approximants: Completeness for Contextfree Processes
- Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness
- RELATING FIRST-ORDER SET THEORIES AND ELEMENTARY STEVE AWODEY, CARSTEN BUTZ, ALEX SIMPSON, AND THOMAS STREICHER
- Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
- Representing Probability Measures using Probabilistic Processes
- A characterisation of the leastfixedpoint operator by dinaturality
- Lazy Functional Algorithms for Exact Real Functionals
- Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness
- Recursive Types in Kleisli Categories Alex K. Simpson \Lambda
- Computational Adequacy in an Elementary Topos
- Two Probabilistic Powerdomains in Topological Domain Theory
- Enriching an Effect Calculus with Linear Types Jeff Egger 1
- Representing Probability Measures using Probabilistic Processes
- Sequent Calculi for Process Verification: Hennessy-Milner Logic for
- Coalgebraic Semantics for Timed Processes Marco Kick, John Power 1,, Alex Simpson 2
- MFPS XV Preliminary Version The Largest Topological Subcategory
- Compositionality via cutelimination: HennessyMilner logic for an arbitrary GSOS
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Axioms and (Counter)examples in Synthetic Domain Theory
- The convex powerdomain in a category of posets realized by cpos
- Constructive Set Theories and their Category-theoretic Models
- Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
- Lambda Definability with Sums via Grothendieck Logical Relations
- Under consideration for publication in Math. Struct. in Comp. Science Two Preservation Results for
- RELATING FIRSTORDER SET THEORIES AND ELEMENTARY STEVE AWODEY, CARSTEN BUTZ, ALEX SIMPSON, AND THOMAS STREICHER
- Reflection using the derivability conditions Se'an Matthews \Lambda
- Under consideration for publication in Math. Struct. in Comp. Science Two Preservation Results for
- Kripke Semantics for a Logical Framework Alex K. Simpson \Lambda
- Math. Struct. in Comp. Science (1996), vol. 11, pp. 1--000 Copyright c fl Cambridge University Press
- Under consideration for publication in Math. Struct. in Comp. Science Topological and Limitspace Subcategories of
- Linearly-used Continuations in the Enriched Effect Calculus
- Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
- Measure, Randomness and Sublocales Alex Simpson
- The Enriched Effect Calculus: Syntax and Semantics
- Measure, Randomness and Sublocales Alex Simpson
