Results 1  10
of
238,273
An Elementary Fragment of SecondOrder Lambda Calculus
 ACM Transactions on Computational Logic
, 2005
"... A fragment of secondorder lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, i.e., the types are assigned levels, and a quantified variable can only be instantiated by a type of smaller ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A fragment of secondorder lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, i.e., the types are assigned levels, and a quantified variable can only be instantiated by a type
On Extensions of. . . : SecondOrder LambdaCalculus with Subtyping
, 1994
"... F was an extension of a secondorder calculus F which has parametric polymorphism with subtyping and bounded quantification, introduced by Ghelli to apply secondorder calculi to the framework of objectoriented languages. However, it is impossible to know the amount of information of a typeche ..."
Abstract
 Add to MetaCart
F was an extension of a secondorder calculus F which has parametric polymorphism with subtyping and bounded quantification, introduced by Ghelli to apply secondorder calculi to the framework of objectoriented languages. However, it is impossible to know the amount of information of a type
Defining Recursors by Solving Equations in SecondOrder Lambda Calculus
"... Abstract. Positive recursive (fixpoint) types can be added to the polymorphic (Churchstyle) lambda calculus λ2 (System F) in several different ways, depending on the choice of the elimination operator. Known extensions of λ2 fall into two equivalence classes with respect to mutual interpretability ..."
Abstract
 Add to MetaCart
Abstract. Positive recursive (fixpoint) types can be added to the polymorphic (Churchstyle) lambda calculus λ2 (System F) in several different ways, depending on the choice of the elimination operator. Known extensions of λ2 fall into two equivalence classes with respect to mutual interpretability
Typability and Type Checking in the SecondOrder lambdaCalculus Are Equivalent and Undecidable
, 1993
"... We consider the problems of typability and type checking in the Girard/Reynolds secondorder polymorphic typedcalculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pureterms. These problems have been considere ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We consider the problems of typability and type checking in the Girard/Reynolds secondorder polymorphic typedcalculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pureterms. These problems have been
Kripke Models and the (in)equational Logic of the SecondOrder LambdaCalculus
, 1995
"... . We define a new class of Kripke structures for the secondorder calculus, and investigate the soundness and completeness of some proof systems for proving inequalities (rewrite rules) as well as equations. The Kripke structures under consideration are equipped with preorders that correspond to an ..."
Abstract
 Add to MetaCart
. We define a new class of Kripke structures for the secondorder calculus, and investigate the soundness and completeness of some proof systems for proving inequalities (rewrite rules) as well as equations. The Kripke structures under consideration are equipped with preorders that correspond
Second order lambda calculus for meaning assembly: on the logical syntax of plurals
, 2011
"... Overview In order to model a number of phenomena of lexical pragmatics in a compositional framework, several contributions developed in our team [1, 4, 6, 5] have used the system F of JeanYves Girard (1971) [2, 3] to compose logical formulae expressing the meaning, while standard Montague semantics ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Overview In order to model a number of phenomena of lexical pragmatics in a compositional framework, several contributions developed in our team [1, 4, 6, 5] have used the system F of JeanYves Girard (1971) [2, 3] to compose logical formulae expressing the meaning, while standard Montague
unknown title
, 2011
"... Second order lambda calculus for meaning assembly: on the logical syntax of plurals ..."
Abstract
 Add to MetaCart
Second order lambda calculus for meaning assembly: on the logical syntax of plurals
COMPUTING SCIENCE NOTES
"... Cpomodels for second order lambda calculus with recursive types and subtyping by ..."
Abstract
 Add to MetaCart
Cpomodels for second order lambda calculus with recursive types and subtyping by
A Full Continuous Model of Polymorphism
"... Abstract. We introduce a model of the secondorder lambda calculus. Such a model is a Scott domain whose elements are themselves Scott domains, and in it polymorphic maps are interpreted by generic continous maps. Keywords: Secondorder lambda calculus, model, Scott domain, nonparametric. 1 ..."
Abstract
 Add to MetaCart
Abstract. We introduce a model of the secondorder lambda calculus. Such a model is a Scott domain whose elements are themselves Scott domains, and in it polymorphic maps are interpreted by generic continous maps. Keywords: Secondorder lambda calculus, model, Scott domain, nonparametric. 1
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
Results 1  10
of
238,273