1999 search results - page 26 / 400 » Dependently Typed Grammars |
111
click to vote
CORR
2011
Springer
14 years 9 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...
132
click to vote
CSL
2000
Springer
15 years 6 months ago
2000
Springer
We introduce basic concepts from object-oriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interf...
112
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
104
click to vote
PPDP
2009
Springer
15 years 8 months ago
2009
Springer
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
110
click to vote
IFL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...