Skip to main content
SpringerLink
Log in

Schema-Based Transformations of Logic Programs

  • Conference paper
Logic Program Synthesis and Transformation

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Transformation schemata are predefined abstract transformations of logic programs: input program schemata are transformed into output program schemata. Each transformation schema represents one transformation strategy, for example a particular sequence of applications of the unfold/fold rules, or the introduction of an accumulator data structure. The transformation of logic programs with the help of transformation schemata proceeds in three steps: abstraction of the programs to program schemata, selection of a transformation schema with these schemata as input and a suitable schema as output, and specialization of the output schema to the transformed program. Once the transformation schemata are available, user intervention is required only during the selection step. For standard transformation situations one can even envisage eliminating user interaction altogether by heuristics.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Brna, A. Bundy, T. Dodd, M. Eisenstadt, CK. Looi, H. Pain, B. Smith, M. van Someren, Prolog Programming Techniques, DAI Research Paper, 403, Department of Artificial Intelligence, University of Edinburgh, 1988

    Google Scholar 

  2. R. Burs tall, J. Darlington, Transformations for Developing Recursive Programs, J ACM, Vol. 24, No. 1,1977

    Google Scholar 

  3. Y. Deville, J. Burnay, Generalization and Program Schemata. Proceedings of the North American Conference on Logic Programming 1989, E. L. Lusk, R. A. Overbeek (eds.), MIT Press, October 1989, pp. 409-425.

    Google Scholar 

  4. J. Gallagher, Program Analysis and Transformation, Handout at Logic Programming Summer School LPSS’ 90, University of Zurich, August 1990

    Google Scholar 

  5. P. A. Gardner, J. C. Shepherdson, Unfold/Fold Transformations of Logic Programs, Report PM-89-01, School of Mathematics, University of Bristol, 1989

    Google Scholar 

  6. T. S. Gegg-Harrison, Basic Prolog Schemata, CS-1989-20, Department of Computer Science, Duke University, September 1989

    Google Scholar 

  7. A. Lakhotia, Incorporating Programming Techniques into Prolog Programs. Proceedings of the North American Conference on Logic Programming 1989, E. L. Lusk, R. A. Overbeek (eds.), MIT Press, October 1989, pp. 426-440.

    Google Scholar 

  8. A. Lakhotia, L. Sterling, How to Control Unfolding when Specializing Interpreters, in L. Sterling (ed.), The Practice of Prolog, MIT Press, 1990, pp. 171

    Google Scholar 

  9. H. R. Nielson, F. Nielson, Eureka Definitions for Free-Disagreement Points for Fold/Unfold Transformations, Proceedings of ESOP ′90, LNCS 432,1990, pp. 291-305

    Google Scholar 

  10. R. A. O’Keefe, The Craft of Prolog. MIT Press, 1990

    Google Scholar 

  11. F. C. N. Pereira, S. M. Shieber, Prolog and Natural-Language Analysis, CSLI, Lectures Notes 10,1987

    Google Scholar 

  12. M. Proietti, A. Pettorossi, Synthesis of Eureka Predicates for Developing Logic Programs, Proceedings of ESOP’ 90, LNCS 432, 1990, pp. 306-325

    Google Scholar 

  13. D. Robertson, A Simple Prolog Techniques Editor for Novice Users, Proceedings of ALPUK 91, 3rd Annual Conference on Logic Programming, Edinburgh, April 1991

    Google Scholar 

  14. H. Tamaki, T. Sato, Unfold/Fold Transformation of Logic Programs, Proceedings of the Second International Conference on Logic Programming, Uppsala, 1984, S.-A. Tarnlund (ed.), University of Uppsala, pp. 127-138

    Google Scholar 

  15. M. Waldau, Formal Validation of Transformation Schemas Using First-Order Proofs, Proceedings of LOPSTR’ 91, University of Manchester, Springer Workshop in Computing Series (this volume), 1991

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut fur Informatik, Universitat Zurich, Switzerland

    Norbert E. Fuchs & Markus P. J. Fromherz

Authors
  1. Norbert E. Fuchs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus P. J. Fromherz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9PL, UK

    Timothy Paul Clement MA, DPhil  & Kung-Kiu Lau BSc, PhD  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag London

About this paper

Cite this paper

Fuchs, N.E., Fromherz, M.P.J. (1992). Schema-Based Transformations of Logic Programs. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3494-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3494-7_9

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19742-3

  • Online ISBN: 978-1-4471-3494-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation