λ-Calculus and Computer Science Theory, 1975 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 Lecture Notes in Computer Science Series, Vol. 37

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.- Some philosophical issues concerning theories of combinators.- Open problems.