Notions of computability at higher types II (2001)

Cached

Download Links

by John Longley
Venue:In preparation
Citations:2 - 2 self

Active Bibliography

11 Notions of computability at higher types I – John Longley - 2005
4 On the ubiquity of certain total type structures – John Longley - 2007
The Combinatory Algebras U and ... are not Equivalent – Karl Gernot Belger
36 The sequentially realizable functionals – John Longley
Realizability Models for Sequential Computation – John Longley - 1998
1 Variations on Realizability: Realizing the Propositional Axiom of Choice – J. M. E. Hyland - 2000
1 Matching typed and untyped realizability (Extended abstract) – John Longley
6 Comparing Hierarchies of Types in Models of Linear Logic – Paul-Andre Mellies - 2003
12 Constructive Data Refinement in Typed Lambda Calculus – Furio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki - 2000
4 Parallel and Serial Hypercoherences – Thomas Ehrhard - 1995
12 Sequential algorithms and strongly stable functions – Paul-André Melliès - 2003
133 Games and Full Abstraction for the Lazy lambda-calculus – Samson Abramsky, Guy Mccusker - 1995
1 A Proof System for Correct Program Development – M.P. Fourman, J. D. Fleuriot, J.R. Longley - 2000
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
2 Linear Programming Languages – Luca Paolini, Mauro Piccolo
2 Behavioural equivalence and indistinguishability in higher-order typed languages – Shin-ya Katsumata - 2003
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
3 A general class of models of H – Giulio Manzonetto
Models and theories of λ-calculus – Giulio Manzonetto, Università Ca, Foscari Venezia - 904