Projecting sequential algorithms on strongly stable functions

Annals of Pure and Applied Logic

Volumn 77, Issue 3, 1996, Pages 201-244

  Ehrhard, Thomas ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000419710     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00026-7     Document Type: Article

References (26)

1. S. Abramsky and R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic 59 (1994) 543-574.
2. S. Abramsky, R. Jagadeesan and P. Malacaria, Full abstraction for PCF, in: Proc. Theoretical Aspects of Computer Science, Sendai, Japan (1994).
3. G. Berry, Stable models of typed lambda-calculi, in: Proc. 5th Internat. Coll. on Automata, Languages and Programming, Udine, Lecture Notes in Computer Science 62 (Springer, Berlin, 1978) 72-89.
4. G. Berry, Modèles complètement adéquats et stables des lambda-calculs typés, Thèse de Doctorat d'Etat, Université Paris 7 (1979).
5. G. Berry and P.-L. Curien, Sequential algorithms on concrete data structures, Theoret. Comput. Sci. 20 (1982) 265-321.
6. A. Blass, A game semantics for linear logic, Ann. Pure Appl. Logic 56 (1992) 183-220.
7. A. Bucciarelli and T. Ehrhard, Sequentiality and strong stability, in: Proc. Logic Comput. Sci. Amsterdam (1991) 138-145.
8. A. Bucciarelli and T. Ehrhard, Extensional embedding of a strongly stable model of PCF, in: Proc. 18th Internat. Coll. on Automata, Languages and Programming 1991, Madrid, Lecture Notes in Computer Science 510 (Springer, Berlin, 1991) 35-47.
9. A. Bucciarelli and T. Ehrhard, A theory of sequentiality, Theoret. Comput. Sci. 113 (1993) 273-291.
10. A. Bucciarelli and T. Ehrhard, Sequentiality in an extensional framework, Inform. Comput. 110 (1994) 265-296.
11. P.-L. Curien, Categorical combinators, sequential algorithms and functional programming, Progress in Theoretical Computer Science (Birkhäuser, Basel, 1993).
12. P.-L. Curien, On the symmetry of sequentiality, in: Proc. Mathematical Foundations of Programming Semantics 1993, New Orleans, Lecture Notes in Computer Science 802 (Springer, Berlin, 1993).
13. T. Ehrhard, Hypercoherences: a strongly stable model of linear logic, Math. Struct. Comput. Sci. 3 (1993) 365-385.
14. J.-Y. Girard, The system F of variable types, fifteen years later, Theoret. Comput. Sci. 45 (1986) 159-192.
15. M. Hyland and L. Ong, On full abstraction for PCF, Manuscript, 1994.
16. G. Kahn and G. Plotkin, Domaines Concrets. Rapport IRIA-LABORIA 336, 1978.
17. F. Lamarche, Sequentiality, Games and Linear Logic (abstract), in: G. Winskel, ed., Proc. CLICS Workshop, 23-27 March 1992. Part II, Publications of the Computer Science department of Aarhus university, DAIMI PB 397-II (May 1992) 599-607. A complete version is accessible on the ftp server theory.doc.ic.ac.uk at Imperial College.
18. J. Lambek and P. Scott, Introduction to Higher Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7 (Cambridge Univ. Press, Cambridge, 1986).
19. S. MacLane, Categories for the Working Mathematician, Graduate Texts in Mathematics 5 (Springer, Berlin 1971).
20. R. Milner, Fully abstract models of typed lambda-calculi, Theoret. Comput. Sci. 4 (1977) 1-23.
21. P.W. O'Hearn and J.G. Riecke, Kripke logical relations and PCF, Manuscript, 1994.
22. G. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5 (1977) 223-256.
23. G. Plotkin, Lambda-definability in the full type hierarchy, in: J.P. Seldin and J.R. Hindley, eds., To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism (Academic Press, New York, 1980) 363-373.
24. K. Sieber, Reasoning about sequential functions via logical relations, in: M.P. Fourmann, P.T. Johnstone and A.M. Pitts, eds., Applications of Categories in Computer Science, London Mathematical Society Lecture Note Series 177 (Cambridge Univ. Press, Cambridge, 1992) 258-269.
25. J. Vuillemin, Syntaxe, Sémantique et Axiomatique d'un Langage de Programmation Simple, Thèse de Doctorat d'Etat, Université Paris 7 (1974).
26. G. Winskel, Events in Computation, Ph.D. Thesis, Edinburgh (1981).