Calculus Computer Science Theory (29 results)

Broschiert. Condition: Gut. 370 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 570. …

Condition: New. In English.

Paperback. Condition: New.

Condition: New. pp. 388.

Condition: New. In English.

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Paperback. Condition: Brand New. bilingual edition. 388 pages. French language. 9.60x6.69x0.88 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

paperback. Condition: New. In shrink wrap. Looks like an interesting title.

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Softcover Sehr gut erhalten.

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New.

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

Condition: New. In English.

Hardcover. Condition: Brand New. 420 pages. 9.06x6.06x1.10 inches. In Stock.

Condition: New. Print on Demand pp. 388 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 388.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 semantic. …

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 388 pp. Englisch.…

Taschenbuch. Condition: Neu. ¿-Calculus and Computer Science Theory | Proceedings of the Symposium Held in Rome March 25-27, 1975. IAC - CNR Istituto per le Applicazioni del Calcolo "Mauro Picone" of the Consiglio Nazionale delle Ricerche | C. Böhm | Taschenbuch | xii | Englisch | Springer | EAN 9783540074168 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.…

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematical logic, category theory, and computer science, kappa calculus is a formal system for defining first-order functions. Unlike lambda calculus, kappa calculus has no higher-order functions; its functions are not first class objects. Kappa-calculus can be regarded as 'a reformulation of the first-order fragment of typed lambda calculus'. Because its functions are not first-class objects, evaluation of kappa calculus expressions does not require closures.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. In this title, examples are.…