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

Skip to content

Combinators, lambda-Terms and Proof Theory (Synthese Library).

Combinators, lambda-Terms and Proof Theory (Synthese Library).

Combinators, lambda-Terms and Proof Theory (Synthese Library).
Click to view full size.

Combinators, lambda-Terms and Proof Theory (Synthese Library). Hardback - 1972

by Sören Stenlund

Add to wish list
  • Used
  • Hardback
  • first
Used - Condition: Fine. Clean, tight, and unmarked copy with sharp corners and bright gilt lettering. Spine square and unfaded. Pages c

Description

Combinators, λ‑Terms and Proof Theory

Author: Sören Stenlund Series: Synthese Library (Book 92 of 304) Publisher: D. Reidel Publishing Company, Dordrecht, 1972 Language: English ISBN‑10: 9027703051 ISBN‑13: 9789027703057

Description

Combinators, λ‑Terms and Proof Theory is a foundational monograph in combinatory logic, lambda calculus, and proof theory. According to Springer, the book presents "basic ideas and results in pure combinatory logic and their applications to topics in proof theory," including material revised from Stenlund's earlier notes on combinatory logic.

The Internet Archive confirms the volume contains 184 pages, includes a bibliography, and is based on Stenlund's academic work at Uppsala University.

Core topics include:

  • Combinatory logic foundations

  • λ‑calculus and its relationship to combinators

  • Church–Rosser properties and reduction theory

  • Proof‑theoretic applications

  • Computable functionals and finite‑type systems

This volume remains a key reference for researchers in mathematical logic, type theory, foundations of computation, and the historical development of λ‑calculus.

Collectible Significance

The 1972 Reidel printing is the true first edition and part of the prestigious Synthese Library. Early logic monographs from Reidel were printed in small academic runs, and Fine copies are scarce. Stenlund's work is frequently cited in the literature on λ‑calculus and combinatory logic, making this a desirable volume for collectors of foundational logic and theoretical computer science.

Ask the seller a question Add to wish list
A$1,133.06
A$14.18 Delivery to USA
Standard delivery: 6 to 12 days
More delivery options
Ships from Robert McLean (British Columbia, Canada)
The BIBLIO Guarantee

Details

About Robert McLean British Columbia, Canada

Specialising in: Computer Programming, Mathematics
Biblio member since 2025

I have a large collection of books with strength in computer programming and mathematics.

Terms of Sale:

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

Browse books from Robert McLean

Reader reviews for Combinators, lambda-Terms and Proof Theory (Synthese Library).

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

The aim of this monograph is to present some of the basic ideas and results in pure combinatory logic and their applications to some topics in proof theory, and also to present some work of my own. Some of the material in chapter 1 and 3 has already appeared in my notes Introduction to Combinatory Logic. It appears here in revised form since the presen- tation in my notes is inaccurate in several respects. I would like to express my gratitude to Stig Kanger for his invalu- able advice and encouragement and also for his assistance in a wide variety of matters concerned with my study in Uppsala. I am also in- debted to Per Martin-USf for many valuable and instructive conversa- tions. As will be seen in chapter 4 and 5, I also owe much to the work of Dag Prawitz and W. W. Tait. My thanks also to Craig McKay who read the manuscript and made valuable suggestions. I want, however, to emphasize that the shortcomings that no doubt can be found, are my sole responsibility. Uppsala, February 1972.

Please wait a moment while we load the requested page.

tracking-