Results 1  10
of
36,719
An Introduction to Polymorphic Lambda Calculus
 Logical Foundations of Functional Programming
, 1994
"... Introduction to the Polymorphic Lambda Calculus John C. Reynolds Carnegie Mellon University December 23, 1994 The polymorphic (or secondorder) typed lambda calculus was invented by JeanYves Girard in 1971 [11, 10], and independently reinvented by myself in 1974 [24]. It is extraordinary that ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Introduction to the Polymorphic Lambda Calculus John C. Reynolds Carnegie Mellon University December 23, 1994 The polymorphic (or secondorder) typed lambda calculus was invented by JeanYves Girard in 1971 [11, 10], and independently reinvented by myself in 1974 [24]. It is extraordinary
Region Analysis and the Polymorphic Lambda Calculus
 In Proc. of the 14th Annual IEEE Symposium on Logic in Computer Science
, 1999
"... We show how to translate the region calculus of Tofte and Talpin, a typed lambda calculus that can statically delimit the lifetimes of objects, into an extension of the polymorphic lambda calculus called F # . We give a denotational semantics of F # , and use it to give a simple and abstract proof o ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
We show how to translate the region calculus of Tofte and Talpin, a typed lambda calculus that can statically delimit the lifetimes of objects, into an extension of the polymorphic lambda calculus called F # . We give a denotational semantics of F # , and use it to give a simple and abstract proof
ThirdOrder Matching in the Polymorphic Lambda Calculus
"... We show that it is decidable whether a thirdorder matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can be extracted from it that, given such a problem, returns a substitution if it has a solution and fail otherwise. 1 ..."
Abstract
 Add to MetaCart
We show that it is decidable whether a thirdorder matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can be extracted from it that, given such a problem, returns a substitution if it has a solution and fail otherwise. 1
Abstract Polymorphic Lambda Calculus and Subtyping
"... We present a denotational model for F <, the extension of secondorder lambda calculus with subtyping defined in [Cardelli Wegner 1985]. Types are interpreted as arbitrary cpos and elements of types as natural transformations. We prove the soundness of our model with respect to the equational the ..."
Abstract
 Add to MetaCart
We present a denotational model for F <, the extension of secondorder lambda calculus with subtyping defined in [Cardelli Wegner 1985]. Types are interpreted as arbitrary cpos and elements of types as natural transformations. We prove the soundness of our model with respect to the equational
Polymorphic Lambda Calculus with Dynamic Types
, 2004
"... mir in intensiven Diskussionen nahe gebracht hat. Desweiteren möchte ich mich bei Guido Tack bedanken, dessen Betreuung mir oft hilfreich war. An dieser Stelle danke ich auch den Mitarbeitern des Lehrstuhls für die angenehme Atmosphäre. Hier ist besonders Andreas Rossberg zu erwähnen, von dessen Erf ..."
Abstract
 Add to MetaCart
dynamic type checking is needed to safely link statically typed components. Since type case destroys the parametricity of type abstraction, types. Rossberg [8] was the first to analyse the problem and to propose a calculus that solves it. We will greatly simplify Rossberg’s calculus by developing a
ThirdOrder Matching in the Polymorphic Lambda Calculus
, 1995
"... We show that it is decidable whether a thirdorder matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can be extracted from it that, given such a problem, returns a substitution if it has a solution and fail otherwise. 1 Intro ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We show that it is decidable whether a thirdorder matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can be extracted from it that, given such a problem, returns a substitution if it has a solution and fail otherwise. 1
A New Model Construction for the Polymorphic Lambda Calculus
"... Various models for the GirardReynolds secondorder lambda calculus have been presented in the literature. Except the term model they are either realizability or domain models. In this paper a further model construction is introduced. Types are interpreted as inverse limits of #cochains of finite s ..."
Abstract
 Add to MetaCart
Various models for the GirardReynolds secondorder lambda calculus have been presented in the literature. Except the term model they are either realizability or domain models. In this paper a further model construction is introduced. Types are interpreted as inverse limits of #cochains of finite
The Genericity Theorem and the Notion of Parametricity in the Polymorphic lambdacalculus
 THEORETICAL COMPUTER SCIENCE
, 1992
"... In the polymorphic calculus, one may explicitly define functions that take a type as input and return a term as output. This work focuses on how such functions depend on their input types. Indeed, these functions are generally understood to have an essentially constant meaning on input types. We sh ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
In the polymorphic calculus, one may explicitly define functions that take a type as input and return a term as output. This work focuses on how such functions depend on their input types. Indeed, these functions are generally understood to have an essentially constant meaning on input types. We
Abstraction Barriers and Refinement in the Polymorphic Lambda Calculus
, 2001
"... This thesis is written in LATEX2ε using the report class together with elements from the Edinburgh University csthesis class. The font is Computer Modern 12pt, but scaled down in the booklet format of this thesis. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This thesis is written in LATEX2ε using the report class together with elements from the Edinburgh University csthesis class. The font is Computer Modern 12pt, but scaled down in the booklet format of this thesis.
Results 1  10
of
36,719