31 search results - page 1 / 7 » A New One-Pass Transformation into Monadic Normal Form |
CC
2003
Springer
13 years 9 months ago
2003
Springer
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
ICFP
2006
ACM
14 years 4 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
VLDB
1990
ACM
13 years 8 months ago
1990
ACM
Relations in partitioned normal form are an important subclass of nested relations. This paper is concerned with the problem of restructuring relations in partitioned normal form ...
ENTCS
2008
13 years 4 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...