4757 search results - page 40 / 952 » Monads for Functional Programming |
FPCA
1991
13 years 11 months ago
1991
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
ACL
1997
13 years 9 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
AAIP
2009
13 years 8 months ago
2009
This paper describes our efforts and solutions in porting our IP system IGOR 2 from the termrewriting language MAUDE to HASKELL. We describe how, for our purpose necessary feature...