Research output per year
Research output per year
- 19 results
Search results
-
2014
Relating first-order set theories, toposes and categories of classes
Awodey, S., Butz, C., Simpson, A. & Streicher, T., 2014, In: Annals of Pure and Applied Logic. 165, 2, p. 428-502 75 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
2010
Sequent calculi for induction and infinite descent
Brotherston, J. & Simpson, A., 2010, In: Journal of Logic and Computation. 21, 2, p. 1177-1216 40 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
2007
A Convenient Category of Domains
Battenfeld, I., Schröder, M. & Simpson, A., 2007, In: Electronic Notes in Theoretical Computer Science. 172, p. 69-99 31 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Complete Sequent Calculi for Induction and Infinite Descent
Simpson, A. & Brotherston, J., 2007, Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE Symposium on. Institute of Electrical and Electronics Engineers, p. 51-62 12 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile -
Relating first-order set theories and elementary toposes
Awodey, S., Butz, C., Streicher, T. & Simpson, A., 2007, In: Bulletin of Symbolic Logic. p. 340-358 19 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Two preservation results for countable products of sequential spaces
Schröder, M. & Simpson, A., 2007, In: Mathematical Structures in Computer Science. 17, 1, p. 161-172 12 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
2006
Coalgebraic Semantics for Timed Processes
Kick, M., Power, J. & Simpson, A., 2006, In: Information and Computation. 204, 4, p. 588-609 22 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Compactly Generated Domain Theory
Battenfeld, I., Schröder, M. & Simpson, A., 2006, In: Mathematical Structures in Computer Science. 16, 2, p. 141-161 21 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Probabilistic Observations and Valuations (Extended Abstract)
Schröder, M. & Simpson, A., 2006, In: Electronic Notes in Theoretical Computer Science. 155, p. 605-615 11 p.Research output: Contribution to journal › Article
Open AccessFile -
Representing Probability Measures using Probabilistic Processes
Schröder, M. & Simpson, A., 2006, In: Journal of Complexity. 22, 6, p. 768-788 21 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
2005
Constructive Set Theories and their Category-theoretic Models
Simpson, A., 2005, From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics. Crosilla, L. & Schuster, P. (eds.). Oxford University Press, p. 41-59 19 p.Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed)
-
Reduction in a linear lambda-calculus with applications to operational semantics
Simpson, A., 2005, Term Rewriting and Applications: 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005. Proceedings. Springer, p. 219-234 15 p. (Lecture Notes in Computer Science; vol. 3467).Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed)
Open AccessFile -
2004
Comparing Cartesian-closed Categories of (Core) Compactly Generated Spaces
Escardó, M., Lawson, J. & Simpson, A., 2004, In: Topology and its Applications. 143, 1-3, p. 105-145 41 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
Simpson, A., 2004, In: Annals of Pure and Applied Logic. 130, 1-3, p. 207-275 69 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Sequent Calculi for Process Verification: Hennessy-Milner Logic for an Arbitrary GSOS
Simpson, A., 2004, In: Journal of Logic and Algebraic Programming. 60-61, p. 287-322 35 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Two Constructive Embedding-Extension Theorems with Applications to Continuity Principles and to Banach-Mazur Computability
Bauer, A. & Simpson, A., 2004, In: Mathematical Logic Quarterly. 50, 4-5, p. 351-369 19 p.Research output: Contribution to journal › Article › peer-review
-
2002
Comparing Functional Paradigms for Exact Real-number Computation
Bauer, A., Escardó, M. & Simpson, A., 2002, Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings. Springer, p. 488-500 13 p. (Lecture Notes in Computer Science; vol. 2380).Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed)
Open AccessFile -
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
Simpson, A., 2002, Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on . Institute of Electrical and Electronics Engineers, p. 287-298 12 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile -
Verifying temporal properties using explicit approximants: completeness for context-free processes
Schöpp, U. & Simpson, A., 2002, Foundations of Software Science and Computation Structures. Springer, p. 372-386 15 p. (Lecture Notes in Computer Science; vol. 2303).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile