Research Catalog

Title

Typed lambda calculi and applications : International Conference on Typed Lam[b]da Calculi and Applications, TLCA '93, March 16-18, 1993, Utrecht, the Netherlands : proceedings / M. Bezem, J.F. Groote (eds.).

Author

International Conference on Typed Lambda Calculi and Applications (1993 : Utrecht, Netherlands)

Publication

Berlin ; New York : Springer-Verlag, ©1993.

Items in the Library & Off-site

Details

Additional Authors

• Bezem, M. (Marc), 1956-
• Groote, J. F. (Jan Friso), 1965-

Description

viii, 432 pages : illustrations; 24 cm.

Summary

"The lambda calculus was developed in the 1930s by Alonzo Church. The calculus turned out to be an interesting model of computation and became theprototype for untyped functional programming languages. Operational and denotational semantics for the calculus served as examples for otherprogramming languages. In typed lambda calculi, lambda terms are classified according to their applicative behavior. In the 1960s it was discovered that the types of typed lambda calculi are in fact appearances of logical propositions. Thus there are two possible views of typed lambda calculi: - as models of computation, where terms are viewed as programs in a typed programming language; - as logical theories, where the types are viewed as propositions and the terms as proofs. The practical spin-off from these studies are: - functional programming languages which are mathematically more succinct than imperative programs; - systems for automated proof checking based on lambda caluli. This volume is the proceedings of TLCA '93, the first international conference on Typed Lambda Calculi and Applications, organized by the Department of Philosophy of Utrecht University. It includes29 papers selected from 51 submissions."--PUBLISHER'S WEBSITE.

Series Statement

Lecture notes in computer science ; 664

Uniform Title

Lecture notes in computer science ; 664.

Subject

• Lambda calculus > Congresses
• Lambda calculus
• Lambda-calculus
• Programacao De Computadores
• Lambda calculus > Congrès
• Lambda-calcul > Congrès

Genre/Form

Conference papers and proceedings.

Bibliography (note)

• Includes bibliographical references and index.

Contents

On Mints' reduction for ccc-calculus / Y. Akama -- A formalization of the strong normalization proof for system F in LEGO / Th. Altenkirch -- Partial intersection type assignment in applicative term rewriting systems / S. van Bakel -- Extracting constructive content from classical logic via control-like reductions / F. Barbanera and S. Berardi -- Combining first and higher order rewrite systems with type assignment systems / F. Barbanera and M. Fernandez -- A term calculus for intuitionistic linear logic / N. Benton, G. Bierman, V. de Paiva and M. Hyland -- Program extraction from normalization proofs / U. Berger -- A semantics for [lambda]&-early: a calculus with overloading and early binding / G. Castagna, G. Ghelli and G. Longo -- An abstract notion of application / P. Di Gianantonio and F. Honsell -- The undecidability of typability in the lambda-pi-calculus / G. Dowek -- Recursive types are not conservative over [actual symbol not reproducible] / G. Ghelli -- The conservation theorem revisited / Ph. de Groote -- Modified realizability toposes and strong normalization proofs / J. M. E. Hyland and C.-H. L. Ong -- Semantics of lambda-I and of other substructure lambda calculi / B. Jacobs -- Translating dependent type theory into higher order logic / B. Jacobs and T. Melham -- Studying the fully abstract model of PCF within its continuous function model / A. Jung and A. Stoughton -- A new characterization of lambda definability / A. Jung and J. Tiuryn -- Combining recursive and dynamic types / H. Leiss -- Lambda calculus characterizations of poly-time / D. Leivant and J.-Y. Marion -- Pure type systems formalized / J. McKinna and R. Pollack -- Orthogonal higher-order rewrite systems are confluent / T. Nipkow -- Monotonic versus antimonotonic exponentiation / D. F. Otth -- Inductive definitions in the system Coq; rules and properties / Chr. Paulin-Mohring -- Intersection types and bounded polymorphism / B. C. Pierce -- A logic for parametric polymorphism / G. Plotkin and M. Abadi -- Call-by-value and nondeterminism / K. Sieber -- Lower and upper bounds for reductions of types in [actual symbol not reproducible] and [lambda]P / J. Springintveld -- [lambda]-calculi with conditional rules / M. Takahashi -- Type reconstruction in [actual symbol not reproducible] is undecidable / P. Urzyczyn.

ISBN

• 3540565175
• 9783540565178
• 0387565175
• 9780387565170

LCCN

93021883

OCLC

• ocm27641569
• 27641569
• SCSB-9151637

Owning Institutions

Princeton University Library