BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Typed Lambda Calculi and Applications

Typed Lambda Calculi and Applications

Typed Lambda Calculi and Applications
Stock photo: cover may vary

Typed Lambda Calculi and Applications Papeback -

by Mariangiola Dezani-Ciancaglini (Editor); Gordon Plotkin (Editor)

Add to wish list
  • Used
Used

Description

Springer , pp. 460 . Papeback. Used.
Ask the seller a question Add to wish list
A$92.04
A$5.77 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Typed Lambda Calculi and Applications
  • Author Mariangiola Dezani-Ciancaglini (Editor); Gordon Plotkin (Editor)
  • Binding Papeback
  • Edition 1st
  • Condition Used
  • Pages 452
  • Volumes 1
  • Language ENG
  • Publisher Springer , Berlin, Germany
  • Publication date pp. 460
  • Bookseller's Inventory # 63073014
  • ISBN 9783540590484 / 354059048X
  • Weight 1.41 lbs (0.64 kg)
  • Dimensions 9.21 x 6.14 x 0.93 in (23.39 x 15.60 x 2.36 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 95005969
  • Dewey Decimal Code 511.3
  • Quantity available 1

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Reader reviews for Typed Lambda Calculi and Applications

From the publisher

This volume presents the proceedings of the Second International Conference on Typed Lambda Calculi and Applications, held in Edinburgh, UK in April 1995.
The book contains 29 full revised papers selected from 58 submissions and comprehensively reports the state of the art in the field. The following topics are addressed: proof theory of type systems, logic and type systems, typed lambda calculi as models of (higher-order) computation, semantics of type systems, proof verification via type systems, type systems of programming languages, and typed term rewriting systems.

First line

In [Lam90], Lamping proposed a complex graph reduction technique for the A-calculus that was optimal in the sense of Levy [Le78].
tracking-