Skip to main content
SpringerLink
Log in

Program Transformations Directed by the Evaluation of non Functional Properties

  • Conference paper
Logic Program Synthesis and Transformation

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

  • 33 Accesses

Abstract

Program transformation aims at producing efficient programs from lucid specifications or preliminary versions. Two classes of program transformations can be distinguished [Fea87]. The first class deals with automatic transformations. They are achieved mechanically and no external intervention is needed. Examples are compilation, transformations following a partial evaluation,.

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

Bibliography

  1. R.M. Burstall and J. Darlington. A transformation system for developping recursive programs. J ACM, 24(1): 44–67, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  2. G.L. Burn, C.L. Hankin, and S. Abramsky. Strictness Analysis of Higher Order Functions. Science of Computer Programming, 7: 249–278, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Cousot and R. Cousot. Abstract Interpretation: A unified Lattice Model for Static Analysis of Programs by Construction of Approximation of Fixpoint. 4th POPL, pages 238-252, 1977.

    Google Scholar 

  4. J. Cazin, P. Cros, R. Jacquart, M. Lemoine, and P. Michel. Construction and Reuse of Formal Program Developments. In Springer Verlag, editor, TAPSOFT 91. LNCS, 4 91.

    Google Scholar 

  5. M. S. Feather. A Survey and Classification of Some Program Transformation Approaches and Techniques. In North Holland, editor, IFIP, 87.

    Google Scholar 

  6. G. Huet and B. Lang. Proving and Applying Transformations Expressed with Second-Order Patterns. Acta Informatica, 11 (1): 31–55, 1978

    Article  MathSciNet  MATH  Google Scholar 

  7. A Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edimburgh, 1981.

    Google Scholar 

  8. B. Wegbreit. Mechanical Program Analysis, communications of the ACM, 18: 528–539, 1975.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. O.N.E.R.A-C.E.R.T-D.E.R.I, 2, Avenue Edouard Belin, BP 4025, 31400, Toulouse, France

    Yamine Aït Ameur

Authors
  1. Yamine Aït Ameur
    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

Ameur, Y.A. (1992). Program Transformations Directed by the Evaluation of non Functional Properties. 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_21

Download citation

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

  • 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