dblp.uni-trier.dewww.uni-trier.de

Alex K. Simpson

Alex Simpson

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
39EEAlex Simpson: Linear types for computational effects. POPL 2009: 301
2007
38EERasmus Ejlers Møgelberg, Alex Simpson: Relational Parametricity for Computational Effects. LICS 2007: 346-355
37EEJames Brotherston, Alex Simpson: Complete Sequent Calculi for Induction and Infinite Descent. LICS 2007: 51-62
36EERasmus Ejlers Møgelberg, Alex Simpson: A Logic for Parametric Polymorphism with Effects. TYPES 2007: 142-156
35EEIngo Battenfeld, Matthias Schröder, Alex Simpson: A Convenient Category of Domains. Electr. Notes Theor. Comput. Sci. 172: 69-99 (2007)
34EERasmus Ejlers Møgelberg, Alex Simpson: Relational Parametricity for Control Considered as a Computational Effect. Electr. Notes Theor. Comput. Sci. 173: 295-312 (2007)
33EEAlex Simpson: Programming Languages and Operational Semantics by Fernández Maribel, King's College Publications, 2004, ISBN 0954300637. J. Funct. Program. 17(3): 424-426 (2007)
32EEMatthias Schröder, Alex Simpson: Two preservation results for countable products of sequential spaces. Mathematical Structures in Computer Science 17(1): 161-172 (2007)
2006
31EEIngo Battenfeld, Matthias Schröder, Alex Simpson: A convenient category of domains. Computational Structures for Modelling Space, Time and Causality 2006
30EEMatthias Schröder, Alex Simpson: Probabilistic Observations and Valuations: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 155: 605-615 (2006)
29EEMarco Kick, John Power, Alex Simpson: Coalgebraic semantics for timed processes. Inf. Comput. 204(4): 588-609 (2006)
28EEMatthias Schröder, Alex Simpson: Representing probability measures using probabilistic processes. J. Complexity 22(6): 768-782 (2006)
27EEIngo Battenfeld, Matthias Schröder, Alex Simpson: Compactly generated domain theory. Mathematical Structures in Computer Science 16(2): 141-161 (2006)
2005
26 Matthias Schröder, Alex K. Simpson: Representing Probability Measures using Probabilistic Processes. CCA 2005: 211-226
25EEAlex K. Simpson: Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. RTA 2005: 219-234
2004
24EEAlex K. Simpson: Computational adequacy for recursive types in models of intuitionistic set theory. Ann. Pure Appl. Logic 130(1-3): 207-275 (2004)
23EEAlex K. Simpson: Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS. J. Log. Algebr. Program. 60-61: 287-322 (2004)
22EEAndrej Bauer, Alex Simpson: Two constructive embedding-extension theorems with applications to continuity principles and to Banach-Mazur computability. Math. Log. Q. 50(4-5): 351-369 (2004)
2003
21 Anna Bucalo, Carsten Führmann, Alex K. Simpson: An equational notion of lifting monad. Theor. Comput. Sci. 294(1/2): 31-60 (2003)
2002
20EEUlrich Schöpp, Alex K. Simpson: Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. FoSSaCS 2002: 372-386
19EEAndrej Bauer, Martín Hötzel Escardó, Alex K. Simpson: Comparing Functional Paradigms for Exact Real-Number Computation. ICALP 2002: 488-500
18EEAlex K. Simpson: Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory. LICS 2002: 287-298
17 Matías Menni, Alex K. Simpson: Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces. Mathematical Structures in Computer Science 12(6): 739-770 (2002)
2001
16 Martín Hötzel Escardó, Alex K. Simpson: A Universal Characterization of the Closed Euclidean Interval. LICS 2001: 115-128
2000
15EEAlex K. Simpson, Gordon D. Plotkin: Complete Axioms for Categorical Fixed-Point Operators. LICS 2000: 30-41
14 Jaap van Oosten, Alex K. Simpson: Axioms and (counter) examples in synthetic domain theory. Ann. Pure Appl. Logic 104(1-3): 233-278 (2000)
13EEJaap van Oosten, Alex K. Simpson: Some axiomatic results in synthetic domain theory. Electr. Notes Theor. Comput. Sci. 35: (2000)
1999
12EEAlex K. Simpson: Elementary Axioms for Categories of Classes. LICS 1999: 77-85
11EEMarcelo P. Fiore, Alex K. Simpson: Lambda Definability with Sums via Grothendieck Logical Relations. TLCA 1999: 147-161
10EEMatías Menni, Alex K. Simpson: The Largest Topological Subcategory of Countably-based Equilogical Spaces. Electr. Notes Theor. Comput. Sci. 20: (1999)
9EEAnna Bucalo, Carsten Führmann, Alex K. Simpson: Equational Lifting Monads. Electr. Notes Theor. Comput. Sci. 29: (1999)
1998
8 Alex K. Simpson: Computational Adequacy in an Elementary Topos. CSL 1998: 323-342
7EEAlex K. Simpson: Lazy Functional Algorithms for Exact Real Functionals. MFCS 1998: 456-464
1997
6 John R. Longley, Alex K. Simpson: A Uniform Approach to Domain Theory in Realizability Models. Mathematical Structures in Computer Science 7(5): 469-505 (1997)
1995
5 Alex K. Simpson: The Convex Powerdomain in a Category of Posets Realized by CPOs. Category Theory and Computer Science 1995: 117-145
4 Alex K. Simpson: Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS LICS 1995: 420-430
3 Alex K. Simpson: Categorical completeness results for the simply-typed lambda-calculus. TLCA 1995: 414-427
1993
2 Alex K. Simpson: A Characterisation of the Least-Fixed-Point Operator by Dinaturality. Theor. Comput. Sci. 118(2): 301-314 (1993)
1992
1 Fausto Giunchiglia, Luciano Serafini, Alex K. Simpson: Hierarchical Meta-Logics: Intuitions, Proof Theory and Semantics. META 1992: 235-249

Coauthor Index

1Ingo Battenfeld [27] [31] [35]
2Andrej Bauer [19] [22]
3James Brotherston [37]
4Anna Bucalo [9] [21]
5Martín Hötzel Escardó [16] [19]
6Marcelo P. Fiore [11]
7Carsten Führmann [9] [21]
8Fausto Giunchiglia [1]
9Marco Kick [29]
10John R. Longley [6]
11Matías Menni [10] [17]
12Rasmus Ejlers Møgelberg [34] [36] [38]
13Jaap van Oosten [13] [14]
14Gordon D. Plotkin [15]
15John Power (A. John Power) [29]
16Ulrich Schöpp [20]
17Matthias Schröder [26] [27] [28] [30] [31] [32] [35]
18Luciano Serafini [1]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)