Finitary PCF is not decidable (1996)

Cached

Download Links

by Ralph Loader
Venue:Theoretical Computer Science
Citations:25 - 0 self

Active Bibliography

8 Unary PCF is decidable – Ralph Loader - 1998
13 A Relational Account of Call-by-Value Sequentiality – Anders B. Sandholm, Jon G. Riecke - 1999
23 Correspondence between Operational and Denotational Semantics – C. -h. L. Ong - 1995
32 A Semantic analysis of control – James David Laird - 1998
Q Lecture Notes on Denotational Semantics – Part Ii, Computer Science Tripos, Dr Marcelo Fiore, C A. M. Pitts, G. Winskel, M. Fiore Contents
26 A New Characterization of Lambda Definability – Achim Jung, Jerzy Tiuryn - 1993
Fully Abstract Bidomain Models of the λ-Calculus – Jim Laird - 2001
8 Mechanizing Logical Relations – Allen Stoughton - 1994
25 Abstract Interpretation of Functional Languages: From Theory to Practice – Sebastian Hunt - 1991
17 Definability and full abstraction – Pierre-Louis Curien
5 Games and full abstraction for PCF: preliminary announcement – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1993
66 Full Abstraction for PCF (Extended Abstract) – Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan - 1994
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
29 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
Games in the Semantics of Programming Languages - An Elementary Introduction – Jan Jürjens, Benedikt L Owe, Florian Rudolph (eds, Jan J Urjens - 1999
Higher Order Operationational Techniques in Semantics - Introduction – A. D. Gordon, A. M. Pitts (Eds)
75 Parametric Polymorphism and Operational Equivalence – Andrew M. Pitts - 2000
1 Functional Reachability – C. -h. L. Ong, N. Tzevelekos
Type Theory for Programming Languages – Robert Harper - 1994