Non-uniform hypercoherences

Electronic Notes in Theoretical Computer Science

Volumn 69, Issue , 2003, Pages 62-82

  Boudes, Pierre ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR EQUATIONS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; PROBLEM SOLVING; SEMANTICS; SET THEORY; THEOREM PROVING;

COHERENCE SPACES; HYPERCOHERENCES; MULTISETS; NEUTRAL ELEMENTS;

MATHEMATICAL MODELS;

EID: 18944374095     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80559-0     Document Type: Conference Paper

References (17)

1. Roberto Amadio M., Curien Pierre-Louis. Domains and lambdacalculi, volume 46 of Cambridge Tracts in Theoretical Computer Science. july 1998;Cambridge University Press, Cambridge
2. Abramsky Samson, Jagadeesan Radha, Malacaria Pasquale. Full abstraction for PCF. Theoretical Aspects of Computer Software. 1994;1-15
3. Berry Gérard, Curien Pierre-Louis. Sequential algorithms on concrete data structures. Theoretical Computer Science. (20):1982;265-321
4. Bucciarelli Antonio, Ehrhard Thomas. Sequentiality in an extensional framework. Information and Computation. 110:(2):1994
5. Bucciarelli Antonio, Ehrhard Thomas. On phase semantics and denotational semantics in multiplicative-additive linear logic. APAL. 102:(3):2000;247-282
6. Bucciarelli Antonio, Ehrhard Thomas. On phase semantics and denotational semantics: the exponentials. Annals of Pure and Applied Logic. 109:(3):2001;205-241
7. G. M. Bierman. What is a categorical model of intuitionistic linear logic? In M. Dezani, editor, Proceedings of Conference on Typed lambda calculus and Applications. Springer-Verlag LNCS 902, 1995.
8. A. Bruasse-Bac. Logique linéaire indexée du second ordre. PhD thesis, Université Aix-Marseille II - Méditerranée, 2001.
9. Cartwright Robert, Curien Pierre-Louis, Felleisen Matthias. Fully abstract semantics for observably sequential languages. Information and Computation. 111:(2):1994;297-401
10. Ehrhard Thomas. Hypercoherences: a strongly stable model of linear logic. Mathematical Structures in Computer Science. 3:1993
11. Ehrhard Thomas. A relative definability result for strongly stable functions and some corollaries. Information and Computation. 152:1999
12. Girard Jean-Yves. Linear logic. Theoretical Computer Science. 50:1987;1-102
13. Jean-Yves Girard. On denotational completeness. manuscript, 1996.
14. J. Laird. Games and sequential algorithms. Available by http, 2001.
15. Longley J.R. The sequentially realizable functionals. Annals of Pure and Applied Logic. 117:(1-3):2002;1-93
16. Paul-André Melliès. Extensional collapse and coercions. manuscript, December 2001.
17. Jaap van Oosten. A combinatory algebra for sequential functionals of finite type. Technical Report 996, University of Utrecht, 1997.