default search action
Alex K. Simpson
Person information
- affiliation: University of Ljubljana, Slovenija
- affiliation (until 2015): University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c39]Alex Simpson
:
Equivalence and Conditional Independence in Atomic Sheaf Logic. LICS 2024: 70:1-70:14 - [i5]Alex Simpson:
Equivalence and Conditional Independence in Atomic Sheaf Logic. CoRR abs/2405.11073 (2024) - [i4]Andrej Bauer, Sewon Park, Alex Simpson:
An Imperative Language for Verified Exact Real-Number Computation. CoRR abs/2409.11946 (2024) - 2022
- [e3]Florin Manea
30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference). LIPIcs 216, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-218-1 [contents] - 2020
- [j24]Alex Simpson, Niels F. W. Voorneveld
Behavioural Equivalence via Modalities for Algebraic Effects. ACM Trans. Program. Lang. Syst. 42(1): 4:1-4:45 (2020)
2010 – 2019
- 2019
- [e2]Mikolaj Bojanczyk, Alex Simpson:
Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. Lecture Notes in Computer Science 11425, Springer 2019, ISBN 978-3-030-17126-1 [contents] - [i3]Alex Simpson, Niels F. W. Voorneveld:
Behavioural Equivalence via Modalities for Algebraic Effects. CoRR abs/1904.08843 (2019) - 2018
- [j23]Laura McDonald, Alex Simpson, Sophie Graham, Anna Schultze, Beth Nordstrom, Piyush Durani
Google searches do not correlate with melanoma incidence in majority English speaking countries. npj Digit. Medicine 1 (2018) - [c38]Aliaume Lopez
Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular. CSL 2018: 29:1-29:17 - [c37]Alex Simpson, Niels F. W. Voorneveld
Behavioural Equivalence via Modalities for Algebraic Effects. ESOP 2018: 300-326 - [c36]Alex Simpson:
Category-theoretic Structure for Independence and Conditional Independence. MFPS 2018: 281-297 - 2017
- [j22]Matteo Mio
Łukasiewicz μ-calculus. Fundam. Informaticae 150(3-4): 317-346 (2017) - [c35]Alex Simpson:
Probability Sheaves and the Giry Monad. CALCO 2017: 1:1-1:6 - [c34]Alex Simpson:
Cyclic Arithmetic Is Equivalent to Peano Arithmetic. FoSSaCS 2017: 283-300 - 2016
- [c33]Neil Ghani, Fredrik Nordvall Forsberg
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory. FoSSaCS 2016: 3-19 - 2015
- [i2]Matteo Mio, Alex K. Simpson:
Łukasiewicz μ-calculus. CoRR abs/1510.00797 (2015) - 2014
- [j21]Steven Awodey, Carsten Butz
Relating first-order set theories, toposes and categories of classes. Ann. Pure Appl. Log. 165(2): 428-502 (2014) - [j20]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
The enriched effect calculus: syntax and semantics. J. Log. Comput. 24(3): 615-654 (2014) - [c32]Martín Hötzel Escardó, Alex Simpson:
Abstract Datatypes for Real Numbers in Type Theory. RTA-TLCA 2014: 208-223 - 2013
- [c31]Matteo Mio
A Proof System for Compositional Verification of Probabilistic Concurrent Processes. FoSSaCS 2013: 161-176 - [c30]Alex Simpson:
Conditional Independence in Categories. TACL 2013: 9 - [c29]Matteo Mio
Łukasiewicz mu-Calculus. FICS 2013: 87-104 - [e1]Alex Simpson:
International Workshop on Proof Systems for Program Logics, PSPL 2010, Edinburgh, Scotland, UK, July 10, 2010. EPiC Series in Computing 12, EasyChair 2013 [contents] - 2012
- [j19]Alex K. Simpson, Thomas Streicher:
Constructive toposes with countable sums as models of constructive set theory. Ann. Pure Appl. Log. 163(10): 1419-1436 (2012) - [j18]Alex Simpson:
Measure, randomness and sublocales. Ann. Pure Appl. Log. 163(11): 1642-1659 (2012) - [j17]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Linear-use CPS translations in the Enriched Effect Calculus. Log. Methods Comput. Sci. 8(4) (2012) - 2011
- [j16]James Brotherston, Alex Simpson:
Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6): 1177-1216 (2011) - 2010
- [c28]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Linearly-Used Continuations in the Enriched Effect Calculus. FoSSaCS 2010: 18-32 - [c27]Patricia Johann, Alex Simpson, Janis Voigtländer
A Generic Operational Metatheory for Algebraic Effects. LICS 2010: 209-218
2000 – 2009
- 2009
- [j15]Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Computational Effects. Log. Methods Comput. Sci. 5(3) (2009) - [c26]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Enriching an Effect Calculus with Linear Types. CSL 2009: 240-254 - [c25]Alex Simpson:
Linear types for computational effects. POPL 2009: 301 - 2007
- [j14]Steven Awodey, Carsten Butz
Relating First-order Set Theories and Elementary Toposes. Bull. Symb. Log. 13(3): 340-358 (2007) - [j13]Alex 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) - [j12]Matthias Schröder
Two preservation results for countable products of sequential spaces. Math. Struct. Comput. Sci. 17(1): 161-172 (2007) - [c24]James Brotherston, Alex Simpson:
Complete Sequent Calculi for Induction and Infinite Descent. LICS 2007: 51-62 - [c23]Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Computational Effects. LICS 2007: 346-355 - [c22]Rasmus Ejlers Møgelberg, Alex Simpson:
A Logic for Parametric Polymorphism with Effects. TYPES 2007: 142-156 - [c21]Ingo Battenfeld, Matthias Schröder
A Convenient Category of Domains. Computation, Meaning, and Logic 2007: 69-99 - [c20]Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Control Considered as a Computational Effect. MFPS 2007: 295-312 - 2006
- [j11]Marco Kick, John Power
Coalgebraic semantics for timed processes. Inf. Comput. 204(4): 588-609 (2006) - [j10]Matthias Schröder
Representing probability measures using probabilistic processes. J. Complex. 22(6): 768-782 (2006) - [j9]Ingo Battenfeld, Matthias Schröder
Compactly generated domain theory. Math. Struct. Comput. Sci. 16(2): 141-161 (2006) - [i1]Ingo Battenfeld, Matthias Schröder, Alex Simpson:
A convenient category of domains. Computational Structures for Modelling Space, Time and Causality 2006 - 2005
- [c19]Matthias Schröder, Alex K. Simpson:
Representing Probability Measures using Probabilistic Processes. CCA 2005: 211-226 - [c18]Alex K. Simpson:
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. RTA 2005: 219-234 - [c17]Matthias Schröder
Probabilistic Observations and Valuations: (Extended Abstract). MFPS 2005: 605-615 - [p1]Alex Simpson:
Constructive Set Theories and their Category-theoretic Models. From sets and types to topology and analysis 2005 - 2004
- [j8]Alex K. Simpson:
Computational adequacy for recursive types in models of intuitionistic set theory. Ann. Pure Appl. Log. 130(1-3): 207-275 (2004) - [j7]Alex K. Simpson:
Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS. J. Log. Algebraic Methods Program. 60-61: 287-322 (2004) - [j6]Andrej 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
- [j5]Anna Bucalo, Carsten Führmann, Alex K. Simpson:
An equational notion of lifting monad. Theor. Comput. Sci. 294(1/2): 31-60 (2003) - 2002
- [j4]Matías Menni, Alex K. Simpson:
Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces. Math. Struct. Comput. Sci. 12(6): 739-770 (2002) - [c16]Ulrich Schöpp
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. FoSSaCS 2002: 372-386 - [c15]Andrej Bauer, Martín Hötzel Escardó, Alex K. Simpson:
Comparing Functional Paradigms for Exact Real-Number Computation. ICALP 2002: 488-500 - [c14]Alex K. Simpson:
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory. LICS 2002: 287-298 - 2001
- [c13]Martín Hötzel Escardó, Alex K. Simpson:
A Universal Characterization of the Closed Euclidean Interval. LICS 2001: 115-125 - 2000
- [j3]Jaap van Oosten, Alex K. Simpson:
Axioms and (counter) examples in synthetic domain theory. Ann. Pure Appl. Log. 104(1-3): 233-278 (2000) - [c12]Alex K. Simpson, Gordon D. Plotkin:
Complete Axioms for Categorical Fixed-Point Operators. LICS 2000: 30-41
1990 – 1999
- 1999
- [c11]Alex K. Simpson:
Elementary Axioms for Categories of Classes. LICS 1999: 77-85 - [c10]Marcelo P. Fiore, Alex K. Simpson:
Lambda Definability with Sums via Grothendieck Logical Relations. TLCA 1999: 147-161 - [c9]Matías Menni, Alex K. Simpson:
The Largest Topological Subcategory of Countably-based Equilogical Spaces. MFPS 1999: 375-398 - [c8]Anna Bucalo, Carsten Führmann, Alex K. Simpson:
Equational Lifting Monads. CTCS 1999: 22 - 1998
- [c7]Alex K. Simpson:
Computational Adequacy in an Elementary Topos. CSL 1998: 323-342 - [c6]Alex K. Simpson:
Lazy Functional Algorithms for Exact Real Functionals. MFCS 1998: 456-464 - [c5]Jaap van Oosten, Alex K. Simpson:
Some axiomatic results in synthetic domain theory. Workshop on Domains 1998: 175 - 1997
- [j2]John R. Longley, Alex K. Simpson:
A Uniform Approach to Domain Theory in Realizability Models. Math. Struct. Comput. Sci. 7(5): 469-505 (1997) - 1995
- [c4]Alex K. Simpson:
The Convex Powerdomain in a Category of Posets Realized by CPOs. Category Theory and Computer Science 1995: 117-145 - [c3]Alex K. Simpson:
Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS. LICS 1995: 420-430 - [c2]Alex K. Simpson:
Categorical completeness results for the simply-typed lambda-calculus. TLCA 1995: 414-427 - 1994
- [b1]Alex K. Simpson:
The proof theory and semantics of intuitionistic modal logic. University of Edinburgh, UK, 1994 - 1993
- [j1]Alex K. Simpson:
A Characterisation of the Least-Fixed-Point Operator by Dinaturality. Theor. Comput. Sci. 118(2): 301-314 (1993) - 1992
- [c1]Fausto Giunchiglia, Luciano Serafini, Alex K. Simpson:
Hierarchical Meta-Logics: Intuitions, Proof Theory and Semantics. META 1992: 235-249
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: