


default search action
Theoretical Computer Science, Volume 121
Volume 121, Numbers 1&2, 1993
- Martín Abadi, Luca Cardelli

, Pierre-Louis Curien:
Formal Parametric Polymorphism. 9-58 - Henk Barendregt:

Constructive Proofs of the Range Property in lambda-Calculus. 59-69 - Alessandro Berarducci

, Benedetto Intrigila:
Some New Results on Easy lambda-Terms. 71-88 - Robert L. Constable, Scott F. Smith:

Computational Foundations of Basic Recursive Function Theory. 89-112 - Mario Coppo, Alberto Ferrari:

Type Inference, Abstract Interpretation and Strictness Analysis. 113-143 - Gérard P. Huet:

An Analysis of Böhm's Theorem. 145-167 - G. Jacopini, G. Sontacchi:

General Recursive Functions in a Very Simply Interpretable Typed lambda-Calculus. 169-178 - Stephen D. Brookes:

Historical Introduction to "Concrete Domains" by G. Kahn and Gordon D. Plotkin. 179-186 - Gilles Kahn, Gordon D. Plotkin:

Concrete Domains. 187-277 - Jan Willem Klop, Vincent van Oostrom

, Femke van Raamsdonk:
Combinatory Reduction Systems: Introduction and Survey. 279-308 - Daniel Leivant:

Functions Over Free Algebras Definable in the Simply Typed lambda Calculus. 309-322 - Giuseppe Longo, Kathleen Milsted, Sergei Soloviev:

The Genericity Theorem and Parametricity in the Polymorphic lambda-Calculus. 323-349 - Gordon D. Plotkin:

Set-Theoretical and Other Elementary Models of the lambda-Calculus. 351-409 - Dana S. Scott:

A Type-Theoretical Alternative to ISWIM, CUCH, OWHY. 411-440 - Richard Statman:

Some Examples of Non-Existent Combinators. 441-448

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.




Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID



















