A Uniform Approach to Domain Theory in Realizability Models (1996)

Cached

Download Links

by John R. Longley , Alex K. Simpson
Venue:Mathematical Structures in Computer Science
Citations:19 - 6 self

Documents Related by Co-Citation

60 Realizability Toposes and Language Semantics – J Longley - 1994
53 First steps in synthetic domain theory – Martin Hyland - 1991
21 A Combinatory Algebra for Sequential Functionals of Finite Type – Jaap Van Oosten - 1997
394 LCF considered as a programming language – G D Plotkin - 1977
35 Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion – G.M. Bierman, A. M. Pitts, C. V. Russo
22 Categorical models for Abadi-Plotkin’s Logic for Parametricity – L Birkedal, R E Møgelberg - 2010
33 The fixed point property in synthetic domain theory – Paul Taylor - 1991
36 The sequentially realizable functionals – John Longley
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
191 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
12 A logic for parametric polymorphism. In Typed lambda calculi and applications – Gordon Plotkin, Martín Abadi - 1993
7 Categorical models of PILL – R E Møgelberg, L Birkedal, R L Petersen - 2005
9 Parametric completion for models of polymorphic intuitionistic / linear lambda calculus – R E Møgelberg - 2005
12 order type theory and recursion. Notes for a talk at the Scott Fest – Second - 1993
9 The S-replete construction – J.M.E. Hyland, E. Moggi - 1995
44 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 - 1994
8 A presentation of the initial lift algebra – M Jibladze - 1997