7924 search results - page 1193 / 1585 » Non-Malleable Functions and Their Applications |
161
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
183
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
193
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
162
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
179
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...