The Combinatory Programme (Progress in Theoretical Computer Science 1995 ed.)

The Combinatory Programme (Progress in Theoretical Computer Science 1995 ed.)

By: E. Engeler (author), Karl Aberer (assistant), D. Otth (assistant), O. Gloor (assistant), B. Amrhein (assistant), T. Weibel (assistant), Gerhard Schwarzler (assistant), M. V. Mohrenschildt (assistant)Hardback

Up to 2 WeeksUsually despatched within 2 weeks

£87.42 RRP £93.00  You save £5.58 (6%) With FREE Saver Delivery


Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the most gifted among the mathematicians. This small volume arose under quite differ- ent circumstances, namely within the context of reworking the mathematical foundations of computer science. I have been very lucky in finding gifted students who agreed to work with me and chose, for their Ph. D. theses, subjects that arose from my own attempts 1 to create a coherent mathematical view of these foundations. The result of this collaborative work is presented here in the hope that it does justice to the individual contributor and that the reader has a chance of judging the work as a whole. E. Engeler ETH Zurich, April 1994 lCollected in Chapter III, An Algebraization of Algorithmics, in Algorithmic Properties of Structures, Selected Papers of Erwin Engeler, World Scientific PubJ. Co. , Singapore, 1993, pp. 183-257. I Historical and Philosophical Background Erwin Engeler In the fall of 1928 a young American turned up at the Mathematical Institute of Gottingen, a mecca of mathematicians at the time; he was a young man with a dream and his name was H. B. Curry. He felt that he had the tools in hand with which to solve the problem of foundations of mathematics mice and for all. His was an approach that came to be called "formalist" and embodied that later became known as Combinatory Logic.


I. Historical and Philosophical Background.- 1. From Protologics to Combinatory Algebras.- 2. A Brief Recapitulation of Combinatory Algebra.- 3. An Algebraization of Universal Algebra.- 4. Objects Reflected in Their Properties.- II. An Algebraization of Universal Algebra.- Axiomatic Extensions.- Aspects of Universal Algebra in Combinatory Logic.- Remarks on an Algebraic Theory of Recursive Degrees.- III. An Algebraization of Algorithmics.- An Algebraization of Hierarchical and Recursive Distributed Processes.- Algebra of Approximate Computation.- IV. Relations to Logical Computer-Algebraic Calculi.- Solving Discontinuous Differential Equations.- Types and Consistency.- References.

Product Details

  • ISBN13: 9780817638016
  • Format: Hardback
  • Number Of Pages: 144
  • ID: 9780817638016
  • weight: 880
  • ISBN10: 0817638016
  • edition: 1995 ed.

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly