Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLambda-Calculus and Computer Science Theory 1975: Rome, Italy
- Corrado Böhm:
Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, Italy, March 25-27, 1975. Lecture Notes in Computer Science 37, Springer 1975, ISBN 3-540-07416-3 - Dana S. Scott:
Combinators and classes. 1-26 - J. W. de Bakker:
Least fixed points revisited. 27-61 - Reiji Nakajima:
Infinite normal forms for the lambda - calculus. 62-82 - J. M. E. Hyland:
A survey of some useful partial order relations on terms of the lambda calculus. 83-95 - Corrado Böhm, Mariangiola Dezani-Ciancaglini:
Lambda-terms as total or partial functions on normal forms. 96-121 - Peter H. Welch:
Continuous semantics and inside-out reductions. 122-146 - Jean-Jacques Lévy:
An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus. 147-165 - Louis Nolin:
Les modèles informatiques des lambda-calculus. 166-176 - Giorgio Ausiello:
On the description of time varying systems in lambda - calculus. 177-191 - Gérard P. Huet:
unification in typed lambda calculus. 192-212 - Giuseppe Jacopini:
A condition for identifying two elements of whatever model of combinatory logic. 213-219 - Herbert Egli:
Typed meaning in Scott's lambda - calculus models. 220-239 - Luigia Carlucci Aiello, Mario Aiello:
Programming language semantics in a typed lambda - calculus. 240-251 - Roel C. de Vrijer:
Big trees in a lambda - calculus with lambda - expressions as types. 252-271 - Henk Barendregt:
Normed uniformly reflexive structures. 272-286 - Marisa Venturini Zilli:
A model with nondeterministic computation. 287-296 - Carlo Batini, Alberto Pettorossi
:
On subrecursiveness in weak combinatory logic. 297-311 - Vladimir Yu. Sazonov:
Sequentially and parallelly computable functionals. 312-318 - A. Dubinsky:
Computation on arbitrary algebras. 319-341 - Jan Willem Klop:
On solvability by lambda I - terms. 342-345 - Dana S. Scott:
Some philosophical issues concerning theories of combinators. 346-366 - Open problems. 367-370
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
