Realizability models for BLL-like languages

Theoretical Computer Science

Volumn 318, Issue 1-2, 2004, Pages 121-137

  Hofmann, M ^a   Scott, P J ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Complexity lambda calculus; Finite model theory; Linear logic

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; POLYNOMIALS; PROBABILITY; SEMANTICS; THEOREM PROVING;

BOUNDED LINEAR LOGIC (BLL); COMPLEXITY LAMBDA CALCULUS; FINITE MODEL THEORY; TOTAL GLOBAL FUNCTIONS;

FORMAL LOGIC;

EID: 2442447006     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.019     Document Type: Article

References (18)

1. Barendregt H.P. The Lambda Calculus. 1984;North-Holland, Amsterdam.
2. P. Baillot, Stratified coherent spaces: a denotational semantics for light linear logic, Tech. Report EDI-INF-RR-0025 submitted, available from Informatics Division Report Series, University of Edinburgh, August 2000, http://www.informatics.ed.ac.uk/publications/report/0025.html.
3. Coquand T., Paulin-Mohring C. Inductively Defined Types. Lecture Notes in Computer Science. Vol. 389:1989;Springer, Berlin.
4. Girard J.-Y. Light linear logic. Inform. and Comput. 143:1998.
5. Girard J.-Y., Scedrov A., Scott P.J. Bounded linear logic. Theoret. Comput. Sci. 97:1992;1-66.
6. Goerdt A. Characterizing complexity classes by higher-type primitive recursive definitions. Theoret. Comput. Sci. 100:1992;45-66.
7. Hofmann M. Linear types and non-size-increasing polynomial time computation. Inform. Comput. 183:1999;57-85.
8. M. Hofmann, Type systems for polynomial-time computation, Darmstadt University of Technology, Habilitationsschrift, 1999, appears as Tech. Report ECS-LFCS-99-406, Department of Computer Science, University of Edinburgh, A revised and abridged version has appeared as "Safe recursion with higher types and BCK algebra" in Ann. Pure Appl. Logic 104 (2000) 113-166.
9. M. Hofmann, Type systems for polynomial-time computation, Darmstadt University of Technology, Habilitationsschrift, 1999, appears as Tech. Report ECS-LFCS-99-406, Department of Computer Science, University of Edinburgh, A revised and abridged version has appeared as "Safe recursion with higher types and BCK algebra" in Ann. Pure Appl. Logic 104 (2000) 113-166.
10. M. Hofmann, Programming Languages capturing complexity classes, SIGACT News (Logic Column 9), ftp.research.bell-labs.com/dist/riecke/hofmann.ps.gz.
11. Hyland M. A small complete category. Ann. Pure Appl. Logic. 40:1988;135-165.
12. M. Kanovich, M. Okada, A. Scedrov, Phase semantics for light linear logic, Theoret. Comput. Sci. 294 (2003) 525-549 (extended abstract in ENTCS, Vol. 6, 1997).
13. M. Kanovich, M. Okada, A. Scedrov, Phase semantics for light linear logic, Theoret. Comput. Sci. 294 (2003) 525-549 (extended abstract in ENTCS, Vol. 6, 1997).
14. D. Leivant, Stratified functional programs and computational complexity, Proc. 20th IEEE Symp. on Principles of Programming Languages (POPL'93), Charleston, South Africa, 1993.
15. Leivant D., Marion J.-Y. Lambda calculus characterisations of polytime. Fund. Inform. 19:1993;167-184.
16. Mac Lane S. Categories for the Working Mathematician. 2nd Edition:1998;Springer, Berlin.
17. Pitts A. Polymorphism is set-theoretic, constructively. Pitt D.H. Category Theory and Computer Science. Lecture Notes in Computer Science. Vol. 283:1987;12-39 Springer, Berlin.
18. R. Seely, Linear logic, * -autonomous categories, and cofree coalgebras, in: J. Gray, A. Scedrov, (Eds.), Categories in Computer Science and Logic, Contemporary Mathematics, Vol. 92, American Mathematical Society, Providence, RI, 1989.