30 search results - page 4 / 6 » Fold and Unfold for Program Semantics |
LOPSTR
1998
Springer
13 years 11 months ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
CONCUR
2000
Springer
13 years 12 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
META
1992
13 years 11 months ago
1992
The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation ...