Regular Approximation of Computation Paths in Logic and Functional Languages

@inproceedings{Gallagher1996RegularAO,
  title={Regular Approximation of Computation Paths in Logic and Functional Languages},
  author={John P. Gallagher and Laura Lafave},
  booktitle={Dagstuhl Seminar on Partial Evaluation},
  year={1996}
}
The aim of this work is to compute descriptions of successful computation paths in logic or functional program executions. Computation paths are represented as terms, built from special constructor symbols, each constructor symbol corresponding to a speci c clause or equation in a program. Such terms, called trace-terms, are abstractions of computation trees, which capture information about the control ow of the program. A method of approximating trace-terms is described, based on well… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

61 Citations

051015'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…