4757 search results - page 124 / 952 » Monads for Functional Programming |
116
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
104
Voted
SCP
1998
15 years 2 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
97
Voted
PLPV
2009
ACM
15 years 11 months ago
2009
ACM
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
118
click to vote
PPDP
2001
Springer
15 years 7 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
CADE
2006
Springer
16 years 2 months ago
2006
Springer
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...