Share
typed lambda calculi and applications
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: U.S.A.
(Import costs included in the price)
It will be shipped from our warehouse between
Tuesday, June 11 and
Thursday, June 27.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "typed lambda calculi and applications"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
✓ Producto agregado correctamente al carro, Ir a Pagar.
