Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-23T10:15:33.696Z Has data issue: false hasContentIssue false
  • English
  • Français

Hypercoherences: a strongly stable model of linear logic

Published online by Cambridge University Press:  04 March 2009

Thomas Ehrhard
Thomas Ehrhard
Affiliation:
L.I.T.P. I.B.P., Couloir 55–56, premier étage, Université Paris VII, 2 Place Jussieu, 75251 Paris CEDEX 05, France I.G.M., Université de Marne-la-Vallée, 2 Allée Jean Renoir, 93160 Noisy-le-Grand, France, e-mail: ehrhard@litp.ibp.fr
Get access Rights & Permissions [Opens in a new window]

Abstract

We present a new model of classical linear logic based on the notion of strong stability that was introduced recently in a work about sequentiality written jointly with Antonio Bucciarelli.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 3 , Issue 4 , December 1993 , pp. 365 - 385
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Berry, G. (1978) Stable Models of Typed Lambda-calculi. Proc. ICALP 1978. Springer-Verlag LNCS 62.Google Scholar
Berry, G. (1979) Modèles des lambda-calculs typés, Thèse de Doctorat, Universite Paris 7.Google Scholar
Berry, G. and Curien, P.-L. (1982) Sequential algorithms on concrete data structures. Theor. Comp. Sci. 20.CrossRefGoogle Scholar
Berry, G., Curien, P.-L. and Levy, J.-J. (1985) Full abstraction for sequential languages: the state of the art. French - US Seminar on the Applications of Algebra to Language Definition and Compilation, Fontainebleau (06 1982), Cambridge University Press.Google Scholar
Bucciarelli, A. and Ehrhard, T. (1991) Sequentiality and strong stability. Proc. LICS 1991.CrossRefGoogle Scholar
Curien, P.-L. (1986) Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman.Google Scholar
Girard, J.-Y. (1986) The system F of variable types fifteen years later. Theor. Comp. Sci. 45.CrossRefGoogle Scholar
Girard, J.-Y. (1988) Linear Logic. Theor. Comp. Sci. 50.Google Scholar
Girard, J.-Y. (1991) A new constructive logic: classical logic. vol. 1.3.Google Scholar
Girard, J.-Y., Lafont, Y. and Taylor, P. (1991) Proofs and Types, vol. 7 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.Google Scholar
Kahn, G. and Plotkin, G. (1978) Domaines Concrets, Rapport IRIA-LABORIA 336.Google Scholar
Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag Graduate Texts in Mathematics vol. 5.CrossRefGoogle Scholar
Plotkin, G. (1977) LCF considered as a programming language. Theor. Comp. Sci. 5 223–256.CrossRefGoogle Scholar