917 search results - page 122 / 184 » On the Semantics of Updates in a Functional Language |
POPL
2010
ACM
15 years 9 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...
111
click to vote
IUI
2005
ACM
15 years 5 months ago
2005
ACM
Every program tells a story. Programming, then, is the art of constructing a story about the objects in the program and what they do in various situations. So-called programming l...
ICFP
1999
ACM
15 years 4 months ago
1999
ACM
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
102
click to vote
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
101
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...