|
9
|
Computational Adequacy in an Elementary Topos
– Alex K. Simpson
- 1999
|
|
19
|
A Uniform Approach to Domain Theory in Realizability Models
– John R. Longley, Alex K. Simpson
- 1996
|
|
8
|
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
– Alex Simpson
- 2003
|
|
27
|
Domains and Denotational Semantics: History, Accomplishments and Open Problems
– Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, Ian Stark
- 1996
|
|
7
|
Enrichment and Representation Theorems for Categories of Domains and Continuous Functions
– Marcelo P. Fiore
- 1996
|
|
|
Domains in H
– Marcelo P. Fiore, Giuseppe Rosolini
|
|
17
|
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory
– Marcelo Fiore, Gordon D. Plotkin
- 1997
|
|
|
Studying repleteness in the category of cpos
– Michael Makkai
|
|
36
|
The sequentially realizable functionals
– John Longley
|
|
11
|
Two Models of Synthetic Domain Theory
– Marcelo P. Fiore, Giuseppe Rosolini
- 1997
|
|
|
Part II Local Realizability Toposes and a Modal Logic for
– unknown authors
|
|
18
|
Developing Theories of Types and Computability via Realizability
– Lars Birkedal
- 2000
|
|
|
The King's Buildings Edinburgh EH9 3JZ, Scotland
– Marcelo Fiore
|
|
9
|
The S-replete construction
– J.M.E. Hyland, E. Moggi
- 1995
|
|
6
|
Geometric and higher order logic in terms of abstract Stone duality
– Paul Taylor
- 2000
|
|
10
|
Using synthetic domain theory to prove operational properties of a polymorphic programming language based on strictness
– Alex Simpson
|
|
3
|
Lifting as a KZ-doctrine
– Marcelo P. Fiore
- 1995
|
|
1
|
Variations on Realizability: Realizing the Propositional Axiom of Choice
– J. M. E. Hyland
- 2000
|
|
11
|
Exact Completions and Toposes
– Matias Menni
- 2000
|
