Projecting Sequential Algorithms on Strongly Stable Functions (1993)

Cached

Download Links

by Thomas Ehrhard
Venue:Annals of Pure and Applied Logic
Citations:22 - 2 self

Documents Related by Co-Citation

395 LCF considered as a programming language – G Plotkin - 1977
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
59 Hereditarily Sequential Functionals – Hanno Nickau - 1994
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
36 The sequentially realizable functionals – John Longley
210 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
52 Sequentiality and Strong Stability – A Bucciarelli, T Ehrhard - 1991
53 Full Abstraction for sequential languages: the state of the art – G Berry, P-L Curien, J-J Lévy - 1985
110 Fully abstract models of typed lambda calculi – R Milner - 1977
18 Studying the fully abstract model of PCF within its continuous function model – A Jung, A Stoughton - 1993
49 Fully abstract semantics for observably sequential languages – Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen - 1994
39 Observable Sequentiality and Full Abstraction – Robert Cartwright, Matthias Felleisen - 1992
21 A Combinatory Algebra for Sequential Functionals of Finite Type – Jaap Van Oosten - 1997
40 Modèles Complètement Adéquats et Stables des Lambda-calculs Typés. Thèse de Doctorat d’Etat – G Berry - 1979
59 Hypercoherences: A Strongly Stable Model of Linear Logic – Thomas Ehrhard - 1993
200 On full abstraction for PCF – J M E Hyland, C H L Ong
29 Fully Abstract Models of Programming Languages – A Stoughton - 1988
27 Full Abstraction and Semantic Equivalence – K Mulmuley - 1987
19 A Uniform Approach to Domain Theory in Realizability Models – John R. Longley, Alex K. Simpson - 1996