378 search results - page 41 / 76 » Automating Mathematical Program Transformations |
TPHOL
2005
IEEE
15 years 4 months ago
2005
IEEE
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with t...
ICLA
2009
Springer
15 years 5 months ago
2009
Springer
One of the surprising developments in the area of program verification is how ideas introduced by logicians in the early part of the 20th Century ended up yielding by the 21 Centu...
75
Voted
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
ICFP
2002
ACM
15 years 11 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
ENTCS
2002
14 years 11 months ago
2002
We present a novel technique called comparison checking that helps optimizer writers debug optimizers by testing, for given inputs, that the semantics of a program are not changed...