P.W.M. Koopman, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Operational Machine Specification in a Functional Programming Language. Software Practice and Experience, 25(5):463--499, May 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Computing by Graph Transformation II (COMPUGRAPH II) - Ehrig, (eds.) (1996) (Correct)
....programming languages. Functional programs, and hence functional term graph rewriting systems, are suited as executable specifications. The use of functional term graph rewriting systems as a specification language was investigated by Koopman, Smetsers, van Eekelen, and Plasmeijer [KSEP93, KEP95] To increase the expressive power of such a language, Koopman [Koo94] considers the notion of subtyping with inheritance. In order to speed up the evaluation, Zweije and Koopman [ZK93, Koo93, KZ94] transform term graph rewriting systems into semantically equivalent systems that are operationally ....
P.W.M. Koopman, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Operational Machine Specification in a Functional Programming Language. Software Practice and Experience, 25(5):463--499, May 1995.
Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (3 citations) (Correct)
....programming languages. Functional programs, and hence functional term graph rewriting systems, are suited as executable specifications. The use of functional term graph rewriting systems as 23 a specification language was investigated by Koopman, Smetsers, van Eekelen, and Plasmeijer [KSEP93, KEP95] To increase the expressive power of such a language, Koopman [Koo94] considers the notion of subtyping with inheritance. In order to speed up the evaluation, Zweije and Koopman [ZK93, Koo93, KZ94] transform term graph rewriting systems into semantically equivalent systems that are operationally ....
P.W.M. Koopman, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Operational Machine Specification in a Functional Programming Language. Software Practice and Experience, 25(5):463-- 499, May 1995.
Computing by Graph Transformation II (COMPUGRAPH II) - H. Ehrig, G. Taentzer (Eds.) (1995) (Correct)
....model for functional programming languages. Functional programs, and hence functional term graph rewriting systems, are suited as executable specifications. The use of functional term graph rewriting systems as a specification language was investigated by Koopman, van Eekelen, and Plasmeijer [KEP95]. In order to speed up the evaluation, Zweije and Koopman use symbolic reduction to fully automatically transform term graph rewriting systems into semantically equivalent systems that are operationally more efficient. In [HP95] Habel and Plump apply their recently introduced concept of graph ....
P.W.M. Koopman, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Operational Machine Specification in a Functional Programming Language. Software Practice and Experience, 25(5):463--499, May 1995.
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