Travelled to:1 × Czech Republic
1 × Denmark
1 × France
1 × Japan
1 × Spain
1 × United Kingdom
2 × Italy
3 × USA
Collaborated with:∅ M.H.Escardó U.Schöpp G.D.Plotkin M.P.Fiore A.Bauer
Talks about:complet (3) comput (3) elementari (2) calculus (2) adequaci (2) categor (2) logic (2) axiom (2) type (2) oper (2)
Person: Alex K. Simpson
DBLP: Simpson:Alex_K=
Contributed to:
2005
2002
2002
2002200120001999
1999
199819951995Wrote 11 papers:
- RTA-2005-Simpson #linear #reduction #semantics #λ-calculus
- Reduction in a Linear λ-Calculus with Applications to Operational Semantics (AKS), pp. 219–234.
- FoSSaCS-2002-SchoppS #process #using #verification
- Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes (US, AKS), pp. 372–386.
- ICALP-2002-BauerES #functional #paradigm
- Comparing Functional Paradigms for Exact Real-Number Computation (AB, MHE, AKS), pp. 488–500.
- LICS-2002-Simpson #modelling #recursion #set
- Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (AKS), pp. 287–298.
- LICS-2001-EscardoS
- A Universal Characterization of the Closed Euclidean Interval (MHE, AKS), pp. 115–125.
- LICS-2000-SimpsonP #axiom #category theory #fixpoint
- Complete Axioms for Categorical Fixed-Point Operators (AKS, GDP), pp. 30–41.
- LICS-1999-Simpson #axiom #category theory
- Elementary Axioms for Categories of Classes (AKS), pp. 77–85.
- TLCA-1999-FioreS #logic
- λ Definability with Sums via Grothendieck Logical Relations (MPF, AKS), pp. 147–161.
- CSL-1998-Simpson
- Computational Adequacy in an Elementary Topos (AKS), pp. 323–342.
- LICS-1995-Simpson #composition #logic
- Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS (AKS), pp. 420–430.
- TLCA-1995-Simpson #category theory #λ-calculus
- Categorical completeness results for the simply-typed λ-calculus (AKS), pp. 414–427.