Alex K. Simpson

Affiliations:
  • University of Ljubljana, Slovenija
  • University of Edinburgh, UK (until 2015)


According to our database1, Alex K. Simpson authored at least 60 papers between 1992 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Behavioural Equivalence via Modalities for Algebraic Effects.
ACM Trans. Program. Lang. Syst., 2020

2018
Google searches do not correlate with melanoma incidence in majority English speaking countries.
npj Digit. Medicine, 2018

Category-theoretic Structure for Independence and Conditional Independence.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Łukasiewicz μ-calculus.
Fundam. Informaticae, 2017

Cyclic Arithmetic Is Equivalent to Peano Arithmetic.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Probability Sheaves and the Giry Monad.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2014
The enriched effect calculus: syntax and semantics.
J. Log. Comput., 2014

Relating first-order set theories, toposes and categories of classes.
Ann. Pure Appl. Log., 2014

Abstract Datatypes for Real Numbers in Type Theory.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013
Łukasiewicz mu-Calculus.
Proceedings of the Proceedings Workshop on Fixed Points in Computer Science, 2013

Conditional Independence in Categories.
Proceedings of the TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic, Vanderbilt University, Nashville, Tennessee, USA, July 28, 2013

A Proof System for Compositional Verification of Probabilistic Concurrent Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Linear-use CPS translations in the Enriched Effect Calculus
Log. Methods Comput. Sci., 2012

Constructive toposes with countable sums as models of constructive set theory.
Ann. Pure Appl. Log., 2012

Measure, randomness and sublocales.
Ann. Pure Appl. Log., 2012

2011
Sequent calculi for induction and infinite descent.
J. Log. Comput., 2011

2010
A Generic Operational Metatheory for Algebraic Effects.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Linearly-Used Continuations in the Enriched Effect Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
Relational Parametricity for Computational Effects
Log. Methods Comput. Sci., 2009

Linear types for computational effects.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Enriching an Effect Calculus with Linear Types.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2007
Two preservation results for countable products of sequential spaces.
Math. Struct. Comput. Sci., 2007

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

Relational Parametricity for Control Considered as a Computational Effect.
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

A Convenient Category of Domains.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Relating First-order Set Theories and Elementary Toposes.
Bull. Symb. Log., 2007

A Logic for Parametric Polymorphism with Effects.
Proceedings of the Types for Proofs and Programs, International Conference, 2007

Complete Sequent Calculi for Induction and Infinite Descent.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
Compactly generated domain theory.
Math. Struct. Comput. Sci., 2006

Representing probability measures using probabilistic processes.
J. Complex., 2006

Coalgebraic semantics for timed processes.
Inf. Comput., 2006

2005
Probabilistic Observations and Valuations: (Extended Abstract).
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Constructive Set Theories and their Category-theoretic Models.
Proceedings of the From sets and types to topology and analysis, 2005

2004
Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability.
Math. Log. Q., 2004

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

Computational adequacy for recursive types in models of intuitionistic set theory.
Ann. Pure Appl. Log., 2004

2003
An equational notion of lifting monad.
Theor. Comput. Sci., 2003

2002
Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces.
Math. Struct. Comput. Sci., 2002

Comparing Functional Paradigms for Exact Real-Number Computation.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
A Universal Characterization of the Closed Euclidean Interval.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000
Axioms and (counter) examples in synthetic domain theory.
Ann. Pure Appl. Log., 2000

Complete Axioms for Categorical Fixed-Point Operators.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999
Equational Lifting Monads.
Proceedings of the Conference on Category Theory and Computer Science, 1999

The Largest Topological Subcategory of Countably-based Equilogical Spaces.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Lambda Definability with Sums via Grothendieck Logical Relations.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

Elementary Axioms for Categories of Classes.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
Some axiomatic results in synthetic domain theory.
Proceedings of the Workshop on Domains IV 1998, 1998

Lazy Functional Algorithms for Exact Real Functionals.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Computational Adequacy in an Elementary Topos.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997
A Uniform Approach to Domain Theory in Realizability Models.
Math. Struct. Comput. Sci., 1997

1995
Categorical completeness results for the simply-typed lambda-calculus.
Proceedings of the Typed Lambda Calculi and Applications, 1995

Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS
Proceedings of the Proceedings, 1995

The Convex Powerdomain in a Category of Posets Realized by CPOs.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994
The proof theory and semantics of intuitionistic modal logic.
PhD thesis, 1994

1993
A Characterisation of the Least-Fixed-Point Operator by Dinaturality.
Theor. Comput. Sci., 1993

1992
Hierarchical Meta-Logics: Intuitions, Proof Theory and Semantics.
Proceedings of the Meta-Programming in Logic, 3rd International Workshop, 1992


  Loading...