Semantic evaluation, intersection types and complexity of simply typed lambda calculus

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 15, Issue , 2012, Pages 323-338

  Terui, Kazushige ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Computational complexity; Denotational semantics; Intersection types; Simply typed lambda calculus

Indexed keywords

ABSTRACT MACHINES; DENOTATIONAL SEMANTICS; FOLLOWING PROBLEM; INTERSECTION TYPES; LAMBDA TERMS; LINEAR LOGIC; SEMANTIC EVALUATIONS; SIMPLY TYPED LAMBDA CALCULUS;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL MECHANICS; DIFFERENTIATION (CALCULUS); FINITE AUTOMATA;

SEMANTICS;

EID: 84880220266     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.RTA.2012.323     Document Type: Conference Paper

References (24)

1. Klaus Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3), 2007.
2. Arnold Beckmann. Exact bounds for lengths of reductions in typed lambda-calculus. J. Symb. Log., 66(3):1277-1285, 2001.
3. Richard Blute and Philip Scott. Category theory for linear logicians. In Linear Logic in Computer Science, LMS 316. Cambridge University Press, 2004.
4. Daniel de Carvalho. Execution time of lambda-terms via denotational semantics and intersection types. Mathematical Structures in Computer Science, to appear.
5. Lorenzo Tortora de Falco. Obsessional experiments for linear logic proof-nets. Mathematical Structures in Computer Science, 13(6):799-855, 2003.
6. Thomas Ehrhard. The scott model of linear logic is the extensional collapse of its relational model. Theor. Comput. Sci., to appear.
7. Harvey Friedman. Equality between functionals. In Proceedings of Logic Colloquium'73, LNM 453, pages 22-37, 1975.
8. Andreas Goerdt and Helmut Seidl. Characterizing complexity classes by higher type primitive recursive definitions, Part II. In Proc. 6th IMYCS, LNCS 464, pages 148-158, 1990.
9. Gerd G. Hillebrand and Paris C. Kanellakis. On the expressive power of simply typed and let-polymorphic lambda calculi. In Proceedings of 11th LICS, pages 253-263, 1996.
10. Michael Huth. Linear domains and linear maps. In Proceedings of 9th MFPS, LNCS 802, pages 438-453, 1993.
11. Naoki Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proceedings of 36th POPL, pages 416-428, 2009.
12. Naoki Kobayashi and C.-H. Luke Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In Proceedings of 24th LICS, pages 179-188, 2009.
13. Lars Kristiansen. Complexity-theoretic hierarchies induced by fragments of Gödel's T. Theory Comput. Syst., 43(3-4):516-541, 2008.
14. Lars Kristiansen and Paul J. Voda. Programming languages capturing complexity classes. Nord. J. Comput., 12(2):89-115, 2005.
15. Jean-Louis Krivine. A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation, 20(3):199-207, 2007.
16. Harry G. Mairson. A simple proof of a theorem of Statman. Theor. Comput. Sci., 103(2):387-394, 1992.
17. Paul-Andre Mellies. Categorical semantics of linear logic. In Interactive models of computation and program behaviour, Panoramas et Syntheses 27. Soc. Math. de France, 2009.
18. Sylvain Salvati. On the membership problem for non-linear abstract categorial grammars. Journal of Logic, Language and Information, 19(2):163-183, 2010.
19. Aleksy Schubert. The complexity of β-reduction in low orders. In Proceedings of 5th TLCA, LNCS 2044, pages 400-414, 2001.
20. Richard Statman. The typed lambda-calculus is not elementary recursive. Theor. Comput. Sci., 9:73-81, 1979.
21. Steffen van Bakel. Intersection type assignment systems. Theor. Comput. Sci., 151(2):385- 435, 1995.
22. Steffen van Bakel. Strict intersection types for the lambda calculus. ACM Comput. Surv., 43(3):20, 2011.
23. Glynn Winskel. A linear metalanguage for concurrency. In Proceedings of 7th AMAST, LNCS 1548, pages 42-58, 1998.
24. Glynn Winskel. Linearity and non linearity in distributed computation. In Linear Logic in Computer Science, LMS 316. Cambridge University Press, 2004.