When is a Functional Program Not a Functional Program? (1999)

Cached

Download Links

by John Longley
Venue:Proceedings of Fourth ACM SIGPLAN International Conference on Functional Programming
Citations:19 - 7 self

Active Bibliography

36 The sequentially realizable functionals – John Longley
Realizability Models for Sequential Computation – John Longley - 1998
13 Sequential algorithms and strongly stable functions – Paul-André Melliès - 2003
1 Matching typed and untyped realizability (Extended abstract) – John Longley
The Combinatory Algebras U and ... are not Equivalent – Karl Gernot Belger
4 Parallel and Serial Hypercoherences – Thomas Ehrhard - 1995
12 Notions of computability at higher types I – John Longley - 2005
6 Comparing Hierarchies of Types in Models of Linear Logic – Paul-Andre Mellies - 2003
Notions of Computability for General Datatypes - Case For Support to accompany EPS(RP) – M.P. Fourman, G. D. Plotkin, J.R. Longley
4 Games and Sequential Algorithms – Jim Laird - 2001
Fully Abstract Bidomain Models of the λ-Calculus – Jim Laird - 2001
32 A Semantic analysis of control – James David Laird - 1998
2 Computing with functionals - computability theory or computer science – Dag Normann - 2006
21 A Combinatory Algebra for Sequential Functionals of Finite Type – Jaap Van Oosten - 1997
4 On the ubiquity of certain total type structures – John Longley - 2007
Topic F of APPSEM – April Realisability Models
Part II Local Realizability Toposes and a Modal Logic for – unknown authors
20 Developing Theories of Types and Computability via Realizability – Lars Birkedal - 2000
24 Local Realizability Toposes and a Modal Logic for Computability (Extended Abstracts) – Stephen Awodey, Lars Birkedal, Dana S. Scott - 1999