2076 search results - page 267 / 416 » Functional logic overloading |
111
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
139
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
121
click to vote
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
113
click to vote
ICFP
2002
ACM
16 years 3 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...
125
Voted
POPL
2010
ACM
16 years 19 days ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...