λ-Calculus and Computer Science Theory: Proceedings of the Symposium Held in Rome March 25–27, 1975. IAC - CNR Istituto per le Applicazioni del ... Science, 37) (English and French Edition)

Introduction....Pages IX-IX Combinators and classes....Pages 1-26 Least fixed points revisited....Pages 27-61 Infinite normal forms for the λ-calculus....Pages 62-82 A survey of some useful partial order relations on terms of the lambda calculus....Pages 83-95 λ-Terms as total or partial functions on normal forms....Pages 96-121 Continuous semantics and inside-out reductions....Pages 122-146 An algebraic interpretation of the λβK-calculus and a labelled λ-calculus....Pages 147-165 Les modeles informatiques des λ-calculs....Pages 166-176 On the description of time varying systems in λ-calculus....Pages 177-191 Unification in typed lambda calculus....Pages 192-212 A condition for identifying two elements of whatever model of combinatory logic....Pages 213-219 Typed meaning in Scott's λ-calculus models....Pages 220-239 Programming language semantics in a typed lambda-calculus....Pages 240-251 Big trees in a λ-calculus with λ-expressions as types....Pages 252-271 Normed uniformly reflexive structures....Pages 272-286 A model with nondeterministic computation....Pages 287-296 On subrecursiveness in weak combinatory logic....Pages 297-311 Sequentially and parallelly computable functionals....Pages 312-318 Computation on arbitrary algebras....Pages 319-341 On solvability by λI-terms....Pages 342-345 Some philosophical issues concerning theories of combinators....Pages 346-366 Open problems....Pages 367-370