|
55
|
Realizability Toposes and Language Semantics
– J Longley
- 1995
|
|
52
|
First steps in synthetic domain theory
– J M E Hyland
- 1488
|
|
21
|
A Combinatory Algebra for Sequential Functionals of Finite Type
– Jaap Van Oosten
- 1997
|
|
363
|
LCF considered as a programming language
– G D Plotkin
- 1977
|
|
33
|
Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
– G.M. Bierman, A. M. Pitts, C. V. Russo
|
|
18
|
Categorical models for Abadi and Plotkin’s logic for parametricity
– L Birkedal, R E Møgelberg
- 2005
|
|
32
|
The fixed point property in synthetic domain theory
– P Taylor
- 1991
|
|
36
|
The sequentially realizable functionals
– John Longley
|
|
22
|
Projecting Sequential Algorithms on Strongly Stable Functions
– Thomas Ehrhard
- 1993
|
|
173
|
Full Abstraction for PCF
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1996
|
|
11
|
A logic for parametric polymorphism. In Typed lambda calculi and applications
– G Plotkin, M Abadi
- 1993
|
|
11
|
order type theory and recursion. Notes for a talk at the Scott Fest
– Second
- 1993
|
|
8
|
Parametric completion for models of polymorphic intuitionistic / linear lambda calculus
– R E Møgelberg
|
|
7
|
Categorical models of PILL
– R E Møgelberg, L Birkedal, R L Petersen
- 2005
|
|
9
|
The S-replete construction
– J.M.E. Hyland, E. Moggi
- 1995
|
|
42
|
Continuity and effectiveness in topoi
– G Rosolini
- 1986
|
|
15
|
Program Verification in Synthetic Domain Theory
– B Reus
- 1995
|
|
62
|
Axiomatic Domain Theory in Categories of Partial Maps
– M P Fiore
- 1996
|
|
8
|
A presentation of the initial lift algebra
– M Jibladze
- 1997
|
