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 - Paperback - 1995

by PLOTKIN, GORDON,

Add to wish list
  • New
  • Paperback
  • first
New

Description

Springer, 1995. 1st. Paperback. New/New.
Ask the seller a question Add to wish list
A$65.12
A$21.71 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from DELHI BOOK STORE (Delhi, India)

Details

  • Title TYPED LAMBDA CALCULI AND APPLICATIONS -
  • Author PLOTKIN, GORDON,
  • Binding Paperback
  • Edition 1st
  • Condition New
  • Pages 452
  • Volumes 1
  • Language ENG
  • Publisher Springer, Berlin, Germany
  • Publication date 1995
  • Bookseller's Inventory # AME_9783540590484
  • 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 5

About DELHI BOOK STORE Delhi, India

Biblio member since 2007

Our prime concern is to make books available with its extensive choices of titles on all subjects for medicine, engineers, technocrats, corporates, scientists, academics, students, scholars and many more at attractive price range.

Terms of Sale: BOOKS CAN BE RETURNED IF IT IS UNOPENED OR SHRINK WRAP IS NOT BROKEN.

Browse books from DELHI BOOK STORE

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-