Projecting sequential algorithms on strongly stable functions
- 19 February 1996
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 77 (3) , 201-244
- https://doi.org/10.1016/0168-0072(95)00026-7
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Full Abstraction for PCFInformation and Computation, 2000
- Games and full completeness for multiplicative linear logicThe Journal of Symbolic Logic, 1994
- A theory of sequentialityTheoretical Computer Science, 1993
- Hypercoherences: a strongly stable model of linear logicMathematical Structures in Computer Science, 1993
- Reasoning about sequential functions via logical relationsPublished by Cambridge University Press (CUP) ,1992
- A game semantics for linear logicAnnals of Pure and Applied Logic, 1992
- The system F of variable types, fifteen years laterTheoretical Computer Science, 1986
- Sequential algorithms on concrete data structuresTheoretical Computer Science, 1982
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977