16883 search results - page 308 / 3377 » Generalized Non-Reducible Descriptors |
179
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
153
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We have implemented a two-stage language, Paradise, for building reusable components which are used to price financial products. Paradise is embedded in Haskell and makes heavy us...
164
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
160
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
136
Voted
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...