47 search results - page 7 / 10 » haskell 2009 |
196
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
ICSE
2009
IEEE-ACM
15 years 10 months ago
2009
IEEE-ACM
Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has ...
186
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
81
Voted
GI
2009
Springer
15 years 2 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
129
click to vote
AAIP
2009
14 years 10 months ago
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...