4835 search results - page 512 / 967 » Refactoring Functional Programs |
191
click to vote
CHI
2005
ACM
16 years 7 months ago
2005
ACM
An important way of making interfaces usable by nonexpert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and M...
289
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
157
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
185
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
173
click to vote
POPL
2010
ACM
16 years 4 months 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...