Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5608)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): TLCA: International Conference on Typed Lambda Calculi and Applications
Conference proceedings info: TLCA 2009.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (29 papers)
-
Front Matter
About this book
Keywords
- Cut-elimination theorem
- Heyting arithmetic
- algorithms
- bounded linear logic
- completeness
- complexity
- deduction systems
- games
- lambda calculus
- omega categories
- optimization
- partial orders
- proof
- proof theory
- type checking
Editors and Affiliations
-
Laboratoire PPS (CNRS / Paris 7), Case 7014, Université Paris Diderot - Paris 7, Paris Cedex 13, France
Pierre-Louis Curien
Bibliographic Information
Book Title: Typed Lambda Calculi and Applications
Book Subtitle: 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009, Proceedings
Editors: Pierre-Louis Curien
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-02273-9
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2009
Softcover ISBN: 978-3-642-02272-2Published: 08 June 2009
eBook ISBN: 978-3-642-02273-9Published: 29 June 2009
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 417
Topics: Formal Languages and Automata Theory, Mathematics of Computing, Computer Science Logic and Foundations of Programming, Symbolic and Algebraic Manipulation, Artificial Intelligence, Mathematical Logic and Foundations