Dynamic dependence in term rewriting systems and its application to program slicing
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 415-431
- https://doi.org/10.1007/3-540-58402-1_29
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Natural semanticsPublished by Springer Nature ,2005
- Turning SOS rules into equationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Origin trackingJournal of Symbolic Computation, 1993
- A meta-environment for generating programming environmentsACM Transactions on Software Engineering and Methodology, 1993
- Origin functions in λ-calculus and term rewriting systemsPublished by Springer Nature ,1992
- Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systemsPublished by Association for Computing Machinery (ACM) ,1991
- Occurrences in debugger specificationsPublished by Association for Computing Machinery (ACM) ,1991
- On laziness and optimality in lambda interpreters: tools for specification and analysisPublished by Association for Computing Machinery (ACM) ,1990
- The semantics of program dependencePublished by Association for Computing Machinery (ACM) ,1989
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987