Skip to main content
SpringerLink
Log in

Jungle rewriting: An abstract description of a lazy narrowing machine

  • Conference paper
  • First Online:
Book cover Graph Transformations in Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 776))

Abstract

We propose to use Jungle Rewriting, a graph rewriting formalism, as a formal specification tool for the LANAM, an abstract machine implementing lazy narrowing. Three jungle rewriting systems which model a narrowing program at different levels of abstraction are presented. The first system is proved to be essentially equivalent (from an operational point of view) to the given program. The second one contains only rules which correspond to elementary actions of a narrowing interpreter, while the third one also models the control issues of the abstract machine. We formally prove the equivalence of the first and second systems, while the relationship between the second and the third one is sketched. The last system provides an abstract description of the compiled code of the LANAM, which is outlined.

Research partially supported by the COMPUGRAPH Basic Research Esprit Working Group n. 7183

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, M. Löwe. Logic Programming and Graph Grammars. [EKR 91], pp. 221–237.

    Google Scholar 

  2. A. Corradini, F. Rossi. Hyperedge Replacement Jungle Rewriting for Term Rewriting Systems and Logic Programming. Theoretical Computer Science, 109, 1993, pp. 7–48.

    Google Scholar 

  3. N. Dershowitz, J.-P. Jouannaud. Rewrite Systems. Handbook of Theoretical Computer Science (ed. J. van Leeuwen), Vol. B, North Holland, 1990, pp. 243–320.

    Google Scholar 

  4. H. Eertink, D. Wolz. Symbolic Execution of LOTOS Specifications. IFIP Transactions, Formal Description Techniques V, North-Holland, 1992.

    Google Scholar 

  5. H. Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. [ENRR87], pp. 3–14.

    Google Scholar 

  6. H. Ehrig, H.-J. Kreowski, G. Rozenberg (Eds.). Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science. LNCS 532, 1991

    Google Scholar 

  7. Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld. A., (Eds.). Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 291, 1987.

    Google Scholar 

  8. H. Ehrig, M. Pfender, H.J. Schneider. Graph-grammars: an algebraic approach. Proc, IEEE Conf. on Automata and Switching Theory, 1973, pp. 167–180.

    Google Scholar 

  9. J.R.W. Glauert, J.R. Kennaway, M.R. Sleep, G.W. Sommer. Final Specification of DACTL. Report SYS-C88-11, School of Information Systems, University of East Anglia, Norwich, U.K.

    Google Scholar 

  10. B. Hoffmann, D. Plump. Implementing Term Rewriting by Jungle Evaluation. Informatique théorique et Applications/Theoretical Informatics and Applications, 25 (5), 1991, pp. 445–472.

    Google Scholar 

  11. T. Johnsson. Compiling Lazy Functional Languages, Part 1. PhD thesis, Chalmers Tekniska Högskola, Göteborg, Sweden, 1987.

    Google Scholar 

  12. J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, 1984, (2nd Edition 1987).

    Google Scholar 

  13. H.Lock. The Implementation of Functional Logic Programming Languages. PhD thesis, GMD Universität Karlsruhe, 1992.

    Google Scholar 

  14. R.Loogen. From Reduction Machines to Narrowing Machines. TAPSOFT 1991, Springer, LNCS 494, 1991

    Google Scholar 

  15. P.Padawitz. Computing in Horn Clause Theories. Springer EATCS Monographs on Theor. Com. Sci., 1988

    Google Scholar 

  16. M.S. Paterson, M.N. Wegman. Linear Unification. Journal of Comp. Syst. Sci., 16 (2), 1978, pp. 251–260.

    Google Scholar 

  17. D.H.D.Warren. An Abstract Prolog Instruction Set. SRI International, Technical Note 309, October 1983

    Google Scholar 

  18. D. Wolz, P.Boehm. Compilation of LOTOS Data Type Specifications. Proc. of the IFIP TC6-WG 6.1, 9th International Symposium on Protocol Specification, Testing and Verification (ed. E.Brinksma, G.Scollo, C.A.Vissers), 1989

    Google Scholar 

  19. D. Wolz. Design of a Compiler for Lazy Pattern Driven Narrowing. Proceedings of the 7th international workshop on the specification of abstract data types, Springer LNCS 534. 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Andrea Corradini

  2. Fachbereich 20 Informatik, Technische Universität Berlin, Franklinstraße 28/29, 1000, Berlin 10, Germany

    Dietmar Wolz

Authors
  1. Andrea Corradini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dietmar Wolz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Jürgen Schneider Hartmut Ehrig

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corradini, A., Wolz, D. (1994). Jungle rewriting: An abstract description of a lazy narrowing machine. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-57787-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57787-4

  • Online ISBN: 978-3-540-48333-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation