Reiji Nakajima Infinite normal forms for the lambda - calculus. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:62-82 [Conf]
J. M. E. Hyland A survey of some useful partial order relations on terms of the lambda calculus. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:83-95 [Conf]
Peter H. Welch Continuous semantics and inside-out reductions. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:122-146 [Conf]
Jean-Jacques Lévy An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:147-165 [Conf]
Louis Nolin Les modèles informatiques des lambda-calculus. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:166-176 [Conf]
Giorgio Ausiello On the description of time varying systems in lambda - calculus. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:177-191 [Conf]
Gérard P. Huet unification in typed lambda calculus. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:192-212 [Conf]
Giuseppe Jacopini A condition for identifying two elements of whatever model of combinatory logic. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:213-219 [Conf]
Herbert Egli Typed meaning in Scott's lambda - calculus models. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:220-239 [Conf]
Roel C. de Vrijer Big trees in a lambda - calculus with lambda - expressions as types. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:252-271 [Conf]
Vladimir Yu. Sazonov Sequentially and parallelly computable functionals. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:312-318 [Conf]
A. Dubinsky Computation on arbitrary algebras. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:319-341 [Conf]
Jan Willem Klop On solvability by lambda I - terms. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:342-345 [Conf]
Dana S. Scott Some philosophical issues concerning theories of combinators. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:346-366 [Conf]
Open problems. [Citation Graph (0, 0)][DBLP] Lambda-Calculus and Computer Science Theory, 1975, pp:367-370 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
