A Simple Adequate Categorical Model for PCF (1997)

Cached

Download Links

by Torben Braüner
Venue:In Proceedings of Third International Conference on Typed Lambda Calculi and Applications
Citations:4 - 0 self

Documents Related by Co-Citation

62 Axiomatic Domain Theory in Categories of Partial Maps – M P Fiore - 1994
395 LCF considered as a programming language – G Plotkin - 1977
59 Hereditarily Sequential Functionals – Hanno Nickau - 1994
53 Full Abstraction for sequential languages: the state of the art – G Berry, P-L Curien, J-J Lévy - 1985
200 On full abstraction for PCF – J M E Hyland, C H L Ong
99 What is a Categorical Model of Intuitionistic Linear Logic? – G.M. Bierman, A \gamma A, Gamma \delta \gamma C, Gamma I \gamma A, Gamma A B \gamma C, B \gamma C - 1995
59 Game Theoretic Analysis Of Call-By-Value Computation – Kohei Honda, NOBUKO YOSHIDA - 1997
210 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
65 Call-by-Value Games – Samson Abramsky, Guy Mccusker - 1997
62 Full Abstraction for Functional Languages with Control – James Laird - 1997
49 Games and full abstraction for a functional metalanguage with recursive types – G McCusker - 1996
16 Axioms for full abstraction and full completeness – S Abramsky - 1996
34 On the symmetry of sequentiality – P-L Curien - 1993
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
1 Paper on Games for Higher Order References – Guy A McCusker - 1997
12 Recursive types in Kleisli categories. Unpublished manuscript – A K Simpson - 1992
26 An Axiomatic Approach to Adequacy – Torben Braüner, Torben Brauner, To Anne - 1996
33 Denotational semantics with partial functions – Gordon D Plotkin - 1985
1 Logical full abstraction and PCF. To appear in – J Longley, G Plotkin - 1996