596 search results - page 52 / 120 » Subtyping Recursive Types |
171
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of -theories. Relying on the notion of easy intersection type theory we succes...
158
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
149
click to vote
ACL
2006
15 years 7 months ago
2006
As natural language understanding research advances towards deeper knowledge modeling, the tasks become more and more complex: we are interested in more nuanced word characteristi...
158
click to vote
JCT
2010
15 years 4 months ago
2010
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
171
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...