G. D. Plotkin. Lambda-definability in the full type hierarchy. In To H.B.Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, 1980. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Notes on Sconing and Relators - Mitchell, Scedrov (1993) (28 citations) (Correct)
A Characterization Of Lambda Definability In Categorical Models .. - Alimohamed (1995) (11 citations) (Correct)
Abstract Interpretation of Functional Languages: From Theory to.. - Hunt (1991) (20 citations) (Correct)
Proving Security Protocols With Model Checkers By Data.. - Roscoe (1998) (50 citations) (Correct)
Proving Security Protocols With Model Checkers By Data.. - Roscoe, Broadfoot (1999) (50 citations) (Correct)
From Algol to Polymorphic Linear Lambda-calculus - O'Hearn, Reynolds (1997) (18 citations) (Correct)
When Do Datatypes Commute? - Hoogendijk, Backhouse (1997) (Correct)
Equality Between Functionals in the Presence of Coproducts - Dougherty, Subrahmanyam (1995) (8 citations) (Correct)
Lambda Definability with Sums via Grothendieck Logical Relations - Fiore, Simpson (1999) (3 citations) (Correct)
Type Theory for Programming Languages - Harper (1994) (Correct)
Logic Column 6 - Column Editor Jon (Correct)
A Note On Logical PERs and Reducibility Logical Relations strike.. - Gallier (1998) (Correct)
Full Abstraction for the Second Order Subset of an ALGOL-like.. - Sieber (1995) (20 citations) (Correct)
On Statman's Finite Completeness Theorem - Statman, Dowek (1992) (1 citation) (Correct)
Operational Reasoning for Functions with Local State - Pitts, Stark (1996) (34 citations) (Correct)
Pre-logical Relations - Honsell, Sannella (1999) (12 citations) (Correct)
Pre-logical Relations - Honsell, Sannella (1999) (12 citations) (Correct)
Typed Closure Conversion - Yasuhiko Minamide Greg (Correct)
Compositional Characterization of Observable - Program Properties Bernhard (Correct)
On Statman's Finite Completeness Theorem - Richard Statman Gilles (1992) (1 citation) (Correct)
PCF Definability via Kripke Logical Relations (after O'Hearn.. - de'Liguoro (1996) (Correct)
Pre-logical Relations - Honsell, Sannella (1999) (12 citations) (Correct)
Full Completeness of the Multiplicative Linear Logic of.. - Devarajan, Plotkin, Pratt (6 citations) Self-citation (Plotkin) (Correct)
Full completeness of the multiplicative linear logic of.. - Devarajan, Plotkin, Pratt (6 citations) Self-citation (Plotkin) (Correct)
Full completeness of the multiplicative linear logic of Chu.. - Harish Devarajan (6 citations) Self-citation (Plotkin) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC