As for term rewrite systems, the dependency pair (DP, for short) framewo...
The grammar representation of a narrowing tree for a syntactically
deter...
In this paper, we show a new approach to transformations of an imperativ...
In a reversible language, any forward computation can be undone by a fin...
In the dependency pair framework for proving termination of rewriting
sy...
A proof tableau of Hoare logic is an annotated program with pre- and
pos...
Essentially, in a reversible programming language, for each forward
comp...