Typed Lambda Calculi and Applications

Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings
1997
ISBN: 978-3-540-62688-6
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1210, 412 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1290 g

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997.
The 24 revised full papers presented in the book were carefully selected from a total of 54 submissions. The book reports the main research advances achieved in the area of typed lambda calculi since the predecessor conference, held in 1995, and competently reflects the state of the art in the area.

Zielgruppe

Research

Autoren/Hrsg.

Hindley, J. Roger

Groote, Philippe de

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

A ?-to-CL translation for strong normalization.- Typed intermediate languages for shape analysis.- Minimum information code in a pure functional language with data types.- Matching constraints for the Lambda Calculus of Objects.- Coinductive axiomatization of recursive type equality and subtyping.- A simple adequate categorical model for PCF.- Logical reconstruction of bi-domains.- A module calculus for pure type systems.- An inference algorithm for strictness.- Primitive recursion for higher-order abstract syntax.- Eta-expansions in dependent type theory — The calculus of constructions.- Proof nets, garbage, and computations.- Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi.- Games and weak-head reduction for classical PCF.- A type theoretical view of Böhm-trees.- Semantic techniques for deriving coinductive characterizations of observational equivalences for ?-calculi.- Schwichtenberg-style lambda definability is undecidable.- Outermost-fair rewriting.- Pomset logic: A non-commutative extension of classical linear logic.- Computational reflection in the calculus of constructions and its application to theorem proving.- Names, equations, relations: Practical ways to reason about new.- An axiomatic system of parametricity.- Inhabitation in typed lambda-calculi (a syntactic approach).- Weak and strong beta normalisations in typed ?-calculi.