-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

List of contents

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.

Product details

• Assisted by: Böhm (Editor), C Böhm (Editor), C. Böhm (Editor)
• Publisher: Springer, Berlin
• Languages: English, French
• Product format: Paperback / Softback
• Released: 01.01.1975
• EAN: 9783540074168
• ISBN: 978-3-540-07416-8
• No. of pages: 371
• Weight: 667 g
• Illustrations: XII, 371 p. 1 illus.
• Series: Lecture Notes in Computer Science; Lecture Notes in Computer Science
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > IT