136 search results - page 15 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
ICFP
2005
ACM
14 years 11 months ago
2005
ACM
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
LICS
2007
IEEE
14 years 5 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
DISOPT
2008
13 years 11 months ago
2008
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
MPC
1995
Springer
14 years 2 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
ICFP
2001
ACM
14 years 11 months ago
2001
ACM
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...