Typed Lambda Calculi and Applications

Marc Bezem

ISBN 10: 3540565175 / ISBN 13: 9783540565178

Published by Springer, Springer Mär 1993, 1993

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -The lambda calculus was developed in the 1930s by AlonzoChurch. The calculus turned out to be an interesting modelof computation and became theprototype for untypedfunctional programming languages. Operational anddenotational semantics for the calculus served as examplesfor otherprogramming languages.In typed lambda calculi, lambda terms are classifiedaccording to their applicative behavior. In the 1960s it wasdiscovered that the types of typed lambda calculi are infact appearances of logical propositions. Thus there are twopossible views of typed lambda calculi: as models of computation, where terms are viewed asprograms in a typed programming language; as logical theories, where the types are viewed aspropositions and the terms as proofs.The practical spin-off from these studies are: functional programming languages which aremathematically more succinct than imperative programs; systems for automated proof checking based on lambdacaluli.This volume is the proceedings of TLCA '93, the firstinternational conference on Typed Lambda Calculi andApplications,organized by the Department of Philosophy ofUtrecht University. It includes29 papers selected from 51submissions.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 452 pp. Englisch.

Seller Inventory # 9783540565178

Bibliographic Details

• Title: Typed Lambda Calculi and Applications
• Publisher: Springer, Springer Mär 1993
• Publication Date: 1993
• Language: English
• ISBN 10: 3540565175
• ISBN 13: 9783540565178
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 25D millimeters 235 millimeters width by 155 millimeters height by 25 millimeters depth
• Weight: 680 grams

About this title

Synopsis

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.