1458 search results - page 12 / 292 » Monads for incremental computing |
APLAS
2007
ACM
14 years 1 months ago
2007
ACM
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
BIRTHDAY
2008
Springer
13 years 11 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...
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
CONSTRAINTS
2007
13 years 9 months ago
2007
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
ASWEC
2005
IEEE
14 years 3 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...