1982 search results - page 117 / 397 » Parametricity and dependent types |
180
click to vote
HASKELL
2008
ACM
15 years 7 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
201
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
190
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
191
click to vote
EUROGP
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Genetic Programming has been slow at realizing other programming paradigms than conventional, deterministic, sequential vonNeumann type algorithms. In this contribution w...
137
click to vote
TPHOL
2003
IEEE
15 years 12 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...