230 search results - page 4 / 46 » Automation for Dependently Typed Functional Programming |
112
click to vote
PPDP
2009
Springer
15 years 9 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...
154
Voted
PLPV
2010
ACM
15 years 11 months ago
2010
ACM
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
97
Voted
PLPV
2009
ACM
15 years 11 months ago
2009
ACM
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
119
Voted
LISP
2002
15 years 2 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
133
Voted
PLPV
2009
ACM
15 years 11 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...