| D. A. Espinosa, Semantic Lego, Ph.D. thesis, Columbia University, Department of Computer Science, 1995. |
....have attracted the attention of many researchers. In the work of Steele [Stee94] pseudomonads were proposed as a way of building interpreters out of smaller parts. The first modular interpreter based on monad transformers was a system with the name Semantic Lego, written in Scheme by Espinosa [Espi95]. In this work Espinosa first raised the issue of lifting, and proposed stratification as an alternative. In the work of Liang, Hudak and Jones [Lian95b] monad transformers are demonstrated to succesfully modularize semantic interpreters and the lifting of several monad operations is ....
D. A. Espinosa, Semantic Lego, Ph.D. thesis, Columbia University, Department of Computer Science, 1995.
.... use since all paths are traversed further even if some of them could already be closed (breadth first traversal without reordering of rows) 6 Precomputation of complementary pairs and reordering are concepts used in connection calculi [Bibe87] but can also be found in tableau calculi [Wrig84]. While the procedures described so far use a given ordering of the tableau graph, one can reorder the tableau graph during the traversal in order to close paths as soon as possible. Since a complementary pair indicates that each path containing it is complementary, a single complementary pair ....
Wrightson G., Semantic tableaux, unification and links, technical report, Department of Computer Science, University of Wellington, New Zealand,
No context found.
Espinosa, D.: Semantic Lego, Columbia University, Department of Computer Science, New York, Ph.D. Thesis, 1994
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC