ML Anthology

Using Temporal Abstraction to Understand Recursive Programs Involving Side Effects

Joachim H. Laubsch, Marc Eisenstadt
AAAI 1982 pp. 400-403
/aaai/1982/laubsch1982aaai-using/

Abstract

This paper develops the notion of temporal abstraction, used originally for the automatic understanding of looping constructs, to account for a class of recursive programs involving side effects upon a relational data base. The programs may involve compositions of several side effects, and these side effects can occur either during descent or upon ascent from recursive calls.

PDF AAAI Semantic Scholar

Cite

Text

Laubsch and Eisenstadt. "Using Temporal Abstraction to Understand Recursive Programs Involving Side Effects." AAAI Conference on Artificial Intelligence, 1982.

Markdown

[Laubsch and Eisenstadt. "Using Temporal Abstraction to Understand Recursive Programs Involving Side Effects." AAAI Conference on Artificial Intelligence, 1982.](https://mlanthology.org/aaai/1982/laubsch1982aaai-using/)

BibTeX

@inproceedings{laubsch1982aaai-using,
  title     = {{Using Temporal Abstraction to Understand Recursive Programs Involving Side Effects}},
  author    = {Laubsch, Joachim H. and Eisenstadt, Marc},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1982},
  pages     = {400-403},
  url       = {https://mlanthology.org/aaai/1982/laubsch1982aaai-using/}
}