%A Dana Scott
%T Combinators and classes
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 1-26

%A J.W. de\ Bakker
%T Least fixed points revisited
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 27-61

%A Reiji Nakajima
%T Infinite normal forms for the lambda-calculus
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 62-82

%A J.M.E. Hyland
%T A survey of some useful partial order relations
on terms of the lambda calculus
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 83-93

%A Corrado Bohm
%A Mariangiola Dezani-Ciancaglini
%T Lambda-terms as total or partial functions on normal forms
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 96-121

%A P.H. Welch
%T Continuous semantics and inside-out reductions
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 122-146

%A Jean-Jacques Levy
%T An algebraic interpretation of the lambda-beta-K calculus
and a labelled lambda-calculus
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 147-165

%A Louis Nolin
%T Les modeles informatiques des lambda-calculus
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 166-176

%A Giorgio Ausiello
%T On the description of time varying systems in lambda-calculus
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 177-191

%A Gerard Huet
%T Unification in typed lambda calculus
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 192-212

%A G. Jacopini
%T A condition for indentifying two elements
of whatever model of combinatory logic
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 213-219

%A Herbert Egli
%T Typed meaning in Scott's lambda-calculus models
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 220-239
%K standard model

%A Luigia Aiello
%A Mario Aiello
%T Programming language semantics in a typed lambda-calculus
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 240-251
%K LCF

%A Roel de\ Vrijer
%T Big trees in a lambda-calculus with lambda-expressions as types
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 252-271

%A Henk Barendregt
%T Normed uniformly reflexive structures
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 272-286

%A Marisa Venturini Zilli
%T A model with nondeterministic computation
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 287-296

%A Carlo Batini
%A Alberto Pettorossi
%T On subrecursiveness in weak combinatory logic
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 297-311

%A V.Yu. Sazunov
%T Sequentially and parallelly computable functionals (extended abstract)
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 312-318

%A A. Dubinsky
%T Computation on arbitrary algebras
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 319-341

%A J.W. Klop
%T On solvability by lambda-I-terms
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 342-345

%A Dana Scott
%T Some philosophical issues concerning theories of combinators
%J Proceedings of the Symposium on Lambda-calculus and Computer Science Theory
%C Rome, Italy
%D March 1975
%E C. Bohm
%O published as Lecture Notes in Computer Science 37
by Springer-Verlag
%K lccst lccst75
%P 346-370