9783540074168

Λ-Calculus and Computer Science Theory

Format: Paperback

ISBN13: 9783540074168

Paperback|9783540074168


Overview

Combinators and classes.- Least fixed points revisited.- Infinite normal forms for the ?-calculus.- A survey of some useful partial order relations on terms of the lambda calculus.- ?-Terms as total or partial functions on normal forms.- Continuous semantics and inside-out reductions.- An algebraic interpretation of the ??K-calculus and a labelled ?-calculus.- Les modeles informatiques des ?-calculs.- On the description of time varying systems in ?-calculus.- Unification in typed lambda calculus.- A condition for identifying two elements of whatever model of combinatory logic.- Typed meaning in Scott's ?-calculus models.- Programming language semantics in a typed lambda-calculus.- Big trees in a ?-calculus with ?-expressions as types.- Normed uniformly reflexive structures.- A model with nondeterministic computation.- On subrecursiveness in weak combinatory logic.- Sequentially and parallelly computable functionals.- Computation on arbitrary algebras.- On solvability by ?I-terms.- Somephilosophical issues concerning theories of combinators.- Open problems.

ISBN-13

9783540074168

ISBN-10

3540074163

Weight

1.36 Pounds

Dimensions

6.69 x 0.88 x 9.61 In

List Price

$54.99

Edition

1st Edition

Format

Paperback

Language

English

Pages

xii, 371 pages

Publisher

Springer

Published On

1975-11-01



View All Offers

Sort by:

Condition
Seller
Seller Comments
Price
Used, Good
Seller details
Bonita
★★★★☆

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$96.66

 Free delivery by: 02 Apr 2026


Bookstores.com relies on cookies to improve your experience.