Many mainstream programming interfaces represent computation procedurally, as sequences of instructions, control-flow constructs, and explicit execution steps. However, several important classes of problems are more naturally described declaratively: one specifies the set of candidate states and the condition that makes a state valid. This paper formalizes a predicate-based abstraction for computation over state spaces. A computational problem i...

Read the original article