J. Maraist and F. S. K. Silbermann. A Graph Reduction Technique and an Extension to the G-Machine for Pure, Lazy Functional-Logic Languages. In 6th International Symposium, Programming Language Implementation and Logic Programming, pages 355#369. Springer Verlag, September 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Implementing Escher on a Graph Reduction Machine - Eder (1999) (Correct)
....may update the shared graph; when a shared variable is bound the graph corresponding to the shared expression is duplicated. A further development of this idea is to perform the duplication lazily thus maximising the degree of sharing. It has been investigated for narrowing based languages [18]. Whether similar techniques can be used in EMA has been left for further research. 6 Results A first version of EMA has been implemented based on the Brisk run time system. Appendix C contains a diagram that shows the number of machine reductions in relation to the list length for an experiment ....
J. Maraist and F. S. K. Silbermann. A Graph Reduction Technique and an Extension to the G-Machine for Pure, Lazy Functional-Logic Languages. In 6th International Symposium, Programming Language Implementation and Logic Programming, pages 355--369. Springer Verlag, September 1994.
A Study of the Operational Behaviour of Escher and its.. - Eder (1999) (Correct)
....necessary to correctly support the rewrite rules that add the logic programming features to the pure rewriting model of Escher. This is one aspect of EMA that clearly needs further research. Other areas for further investigation include more sophisticated sharing techniques possibly based on [7] and an integration of the optimisations that have been taken out when simplifying the STGM to the Brisk machine, as long as they don t interfere with the Escher extensions. Nevertheless, a first step towards an implementation of Escher has now been made. Acknowledgement: I would like to thank ....
J. Maraist and F. S. K. Silbermann. A Graph Reduction Technique and an Extension to the G-Machine for Pure, Lazy Functional-Logic Languages. In 6th International Symposium, Programming Language Implementation and Logic Programming, pages 355--369. Springer Verlag, September 1994.
Implementing Escher on a Graph Reduction Machine - Kerstin Eder University (Correct)
No context found.
J. Maraist and F. S. K. Silbermann. A Graph Reduction Technique and an Extension to the G-Machine for Pure, Lazy Functional-Logic Languages. In 6th International Symposium, Programming Language Implementation and Logic Programming, pages 355#369. Springer Verlag, September 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