Results 11  20
of
805
Subtyping recursive types
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1993
"... We investigate the interactions of subtyping and recursive types, in a simply typed λcalculus. The two fundamental questions here are whether two (recursive) types are in the subtype relation, and whether a term has a type. To address the first question, we relate various definitions of type equiva ..."
Abstract

Cited by 320 (9 self)
 Add to MetaCart
We investigate the interactions of subtyping and recursive types, in a simply typed λcalculus. The two fundamental questions here are whether two (recursive) types are in the subtype relation, and whether a term has a type. To address the first question, we relate various definitions of type
A direct algorithm for type inference in the rank2 fragment of the secondorder λcalculus
, 1993
"... We study the problem of type inference for a family of polymorphic type disciplines containing the power of CoreML. This family comprises all levels of the stratification of the secondorder lambdacalculus by "rank" of types. We show that typability is an undecidable problem at every ran ..."
Abstract

Cited by 82 (14 self)
 Add to MetaCart
We study the problem of type inference for a family of polymorphic type disciplines containing the power of CoreML. This family comprises all levels of the stratification of the secondorder lambdacalculus by "rank" of types. We show that typability is an undecidable problem at every
The Modal Object Calculus and its Interpretation∗
"... The modal object calculus is the system of logic which houses the (proper) axiomatic theory of abstract objects.1 This calculus has some rather interesting features in and of itself, independent of the proper theory. The most sophisticated, typetheoretic incarnation of the calculus can be used to ..."
Abstract
 Add to MetaCart
to analyze the intensional contexts of natural language and so constitutes an intensional logic. However, the simpler secondorder version of the calculus couches a theory of finegrained properties, relations and propositions and serves as a framework for defining situations, possible worlds, stories
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 14 (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
Quantified Propositional Calculus and a SecondOrder Theory for NC¹
, 2004
"... Let H be a proof system for the quantified propositional calculus (QPC). We j witnessing problem for H to be: given a prenex S j formula A, an Hproof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out that the S ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Let H be a proof system for the quantified propositional calculus (QPC). We j witnessing problem for H to be: given a prenex S j formula A, an Hproof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out
Secondorder subdifferential calculus with applications to tilt stability in optimization
, 2012
"... ..."
Typability and Type Checking in the SecondOrder
, 1993
"... We consider the problems of typability 1 and type checking 2 in the Girard/Reynolds secondorder polymorphic typed calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure terms. These problems have been cons ..."
Abstract
 Add to MetaCart
We consider the problems of typability 1 and type checking 2 in the Girard/Reynolds secondorder polymorphic typed calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure terms. These problems have been
STRONG NORMALIZATION OF THE SECONDORDER SYMMETRIC LAMBDA–MU CALCULUS
"... Abstract. Parigot [12] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong normalization of the secondorder λµcalculus with such rules. 1. ..."
Abstract
 Add to MetaCart
Abstract. Parigot [12] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong normalization of the secondorder λµcalculus with such rules. 1.
Combining Algebraic Rewriting with the SecondOrder Extensional Polymorphic Lambda Calculus
"... . We prove that strong normalisation and confluence properties are conserved when a leftlinear canonical firstorder algebraic rewriting system is combined with the secondorder polymorphic calculus with a restricted version of jexpansions. This strengthens many results in [4, 5, 8, 11]. We achi ..."
Abstract
 Add to MetaCart
. We prove that strong normalisation and confluence properties are conserved when a leftlinear canonical firstorder algebraic rewriting system is combined with the secondorder polymorphic calculus with a restricted version of jexpansions. This strengthens many results in [4, 5, 8, 11]. We
Simulating etaExpansions with betaReductions in the SecondOrder Polymorphic Calculus
, 1996
"... . We introduce an approach to simulating jexpansions with fireductions in the secondorder polymorphic calculus. This generalizes the work of Di Cosmo and Delia Kesner which simulates jexpansions with fireductions in simply typed settings, positively solving the conjecture on whether the simu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We introduce an approach to simulating jexpansions with fireductions in the secondorder polymorphic calculus. This generalizes the work of Di Cosmo and Delia Kesner which simulates jexpansions with fireductions in simply typed settings, positively solving the conjecture on whether
Results 11  20
of
805