Lambda-Calculus and Computer Science Theory 1975: Rome, Italy

Corrado Böhm (Ed.): Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, March 25-27, 1975. Lecture Notes in Computer Science 37 Springer 1975, ISBN 3-540-07416-3 BibTeX

@proceedings{DBLP:conf/lambda/1975,
  editor    = {Corrado B{\"o}hm},
  title     = {Lambda-Calculus and Computer Science Theory, Proceedings of the
               Symposium Held in Rome, March 25-27, 1975},
  booktitle = {Lambda-Calculus and Computer Science Theory},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {37},
  year      = {1975},
  isbn      = {3-540-07416-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Dana S. Scott: Combinators and classes. 1-26 BibTeX
J. W. de Bakker: Least fixed points revisited. 27-61 BibTeX
Reiji Nakajima: Infinite normal forms for the lambda - calculus. 62-82 BibTeX
J. M. E. Hyland: A survey of some useful partial order relations on terms of the lambda calculus. 83-95 BibTeX
Corrado Böhm, Mariangiola Dezani-Ciancaglini: Lambda-terms as total or partial functions on normal forms. 96-121 BibTeX
Peter H. Welch: Continuous semantics and inside-out reductions. 122-146 BibTeX
Jean-Jacques Lévy: An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus. 147-165 BibTeX
Louis Nolin: Les modèles informatiques des lambda-calculus. 166-176 BibTeX
Giorgio Ausiello: On the description of time varying systems in lambda - calculus. 177-191 BibTeX
Gérard P. Huet: unification in typed lambda calculus. 192-212 BibTeX
Giuseppe Jacopini: A condition for identifying two elements of whatever model of combinatory logic. 213-219 BibTeX
Herbert Egli: Typed meaning in Scott's lambda - calculus models. 220-239 BibTeX
Luigia Carlucci Aiello, Mario Aiello: Programming language semantics in a typed lambda - calculus. 240-251 BibTeX
Roel C. de Vrijer: Big trees in a lambda - calculus with lambda - expressions as types. 252-271 BibTeX
Henk Barendregt: Normed uniformly reflexive structures. 272-286 BibTeX
Marisa Venturini Zilli: A model with nondeterministic computation. 287-296 BibTeX
Carlo Batini, Alberto Pettorossi: On subrecursiveness in weak combinatory logic. 297-311 BibTeX
Vladimir Yu. Sazonov: Sequentially and parallelly computable functionals. 312-318 BibTeX
A. Dubinsky: Computation on arbitrary algebras. 319-341 BibTeX
Jan Willem Klop: On solvability by lambda I - terms. 342-345 BibTeX
Dana S. Scott: Some philosophical issues concerning theories of combinators. 346-366 BibTeX
Open problems. 367-370 BibTeX