Denotational completeness revisited

Electronic Notes in Theoretical Computer Science

Volumn 29, Issue , 1999, Pages 288-300

  Streicher, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Denotational completeness; Kripke logical predicates; Linear logic

Indexed keywords

COHERENT LIGHT; FUNCTIONS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

CLASSICAL LINEAR LOGIC (CLL); DENOTATIONAL COMPLETENESS; KRIPKE LOGICAL PREDICATES; LINEAR LOGIC;

SEMANTICS;

EID: 18944400489     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80321-4     Document Type: Conference Paper

References (8)

1. Altenkirch T., Hofmann M., Streicher T. Categorical reconstruction of a reduction-free normalisation proof. Pitt D. Category Theory in Computer Science, volume 953 of Lecture Notes in Computer Science. 1995;182-199 Springer Verlag
2. Bierman G.M. What is a categorical model of intuitionistic linear logic? Lecture Notes in Computer Science. 902:1995;78-103
3. Girard J.-Y. Linear logic. TCS. 50:(1):1987;1-102
4. Girard J.-Y. On denotational completeness, to appear in TCS. 1995
5. M. Hasegawa. Logical predicates for intuitionistic linear type theories, to appear in in the Proceedings of TLCA99, 1998.
6. Jung A., Tiuryn J. A new characterization of lambda definability. Bezem M., Groote J.F. Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. 1993;245-257 Springer Verlag
7. Seely R. *-autonomous categories, cofree coalgebras and linear logic. Gray J.W., Scedrov A. Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics. 1989;371-382 American Mathematical Society
8. Tan Audrey M. Full Completeness of Models of Linear Logic. PhD thesis, Cambridge University. 1997