Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing
Abstract elided by the publisher.
Related papers
- An unfold/fold transformation framework for definite logic programs TOPLAS 2004
- How Powerful are Folding/Unfolding Transformations? JFP 1994
- Countdown: A case study in Origami programming JFP 2005
- Unifying structured recursion schemes - An Extended Study JFP 2016
- Fold and Unfold for Program Semantics ICFP 1998
- Total Correctness by Local Improvement in the Transformation of Functional Programs TOPLAS 1996
- Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant JFP 2022
- Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant - ERRATUM JFP 2023