Skip to main content
SpringerLink
Log in

Algebra of Program Termination

  • Chapter
  • First Online:
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction

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

Abstract

Well-foundedness and inductive properties of relations are expressed in terms of fixed points. A class of fixed point equations, called “hylo” equations, is introduced. A methodology of recursive program design based on the use of hylo equations is presented. Current research on generalisations of well-foundedness and inductive properties of relations, making these properties relative to a datatype, is introduced.

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. R. C. Backhouse. Program Construction and Verification. Prentice-Hall International, 1986.

    Google Scholar 

  2. R. C. Backhouse, P. de Bruin, P. Hoogendijk, G. Malcolm, T. S. Voermans, and J. van der Woude. Polynomial relators. In M. Nivat, C. S. Rattray, T. Rus, and G. Scollo, editors, Proceedings of the 2nd Conference on Algebraic Methodology and Software Technology, AMAST’91, pages 303–326. Springer-Verlag, Workshops in Computing, 1992.

    Google Scholar 

  3. R. C. Backhouse, P. de Bruin, G. Malcolm, T. S. Voermans, and J. van der Woude. Relational catamorphisms. In Möller B., editor, Proceedings of the IFIP TC2/WG2.1 Working Conference on Constructing Programs from Specifications, pages 287–318. Elsevier Science Publishers B. V., 1991.

    Google Scholar 

  4. Roland Backhouse and Paul Hoogendijk. Final dialgebras: From categories to allegories. Theoretical Informatics and Applications, 33(4/5):401–426, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. Roland Backhouse, Patrik Jansson, Johan Jeuring, and Lambert Meertens. Generic programming. An introduction. In S. D. Swierstra, editor, 3rd International Summer School on Advanced Functional Programming, Braga, Portugal, 12th–19th September, 1998, volume LNCS 1608, pages 28–115. Springer Verlag, 1999.

    Google Scholar 

  6. R. C. Backhouse and J. van der Woude. Demonic operators and monotype factors. Mathematical Structures in Computer Science, 3(4):417–433, December 1993.

    Article  MATH  MathSciNet  Google Scholar 

  7. Henk Doornbos and Roland Backhouse. Induction and recursion on datatypes. In B. Möller, editor, Mathematics of Program Construction, 3rd International Conference, volume 947 of LNCS, pages 242–256. Springer-Verlag, July 1995.

    Google Scholar 

  8. Henk Doornbos and Roland Backhouse. Reductivity. Science of Computer Programming, 26(1–3):217–236, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. Doornbos, R. C. Backhouse, and J. van der Woude. A calculation approach to mathematical induction. Theoretical Computer Science, (179):103–135, 1997.

    Google Scholar 

  10. H. Doornbos. Reductivity arguments and program construction. PhD thesis, Eindhoven University of Technology, Department of Mathematics and Computing Science, June 1996.

    Google Scholar 

  11. P. J. Freyd and A. Ščedrov. Categories, Allegories. North-Holland, 1990.

    Google Scholar 

  12. D. Gries. The Science of Programming. Springer-Verlag, New York, 1981.

    MATH  Google Scholar 

  13. Paul Hoogendijk and Oege de Moor. Container types categorically. Journal of Functional Programming, 10(2):191–225, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. A. R. Hoare and Jifeng He. The weakest prespecification. Fundamenta Informaticae, 9:51–84, 217–252, 1986.

    MATH  MathSciNet  Google Scholar 

  15. Paul Hoogendijk. A Generic Theory of Datatypes. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1997.

    Google Scholar 

  16. J. Lambek. A fixpoint theorem for complete categories. Mathematische Zeitschrift, 103:151–161, 1968.

    Article  MATH  MathSciNet  Google Scholar 

  17. G. Malcolm. Algebraic data types and program transformation. PhD thesis, Groningen University, 1990.

    Google Scholar 

  18. G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14(2–3):255–280, October 1990.

    Article  MathSciNet  MATH  Google Scholar 

  19. L. Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413–424, 1992.

    Article  MATH  Google Scholar 

  20. Eric Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA’ 91: Functional Programming Languages and Computer Architecture, number 523 in LNCS, pages 124–144. Springer-Verlag, 1991.

    Google Scholar 

  21. Doaitse Swierstra and Oege de Moor. Virtual data structures. In Helmut Partsch, Bernhard Möller, and Steve Schuman, editors, Formal Program Development, volume 755 of LNCS, pages 355–371. Springer-Verlag, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EverMind, Groningen, The Netherlands

    Henk Doornbos

  2. School of Computer Science and Information Technology, University of Nottingham, UK

    Roland Backhouse

Authors
  1. Henk Doornbos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland Backhouse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and IT, University of Nottingham, Jubilee Campus, Wollaton Road, NG8 1BB, Nottingham, UK

    Roland Backhouse

  2. Dept. of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Roy Crole

  3. Oxford University Computing Laboratory, Wolfson Building Parks Road, OX1 3QD, Oxford, UK

    Jeremy Gibbons

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Doornbos, H., Backhouse, R. (2002). Algebra of Program Termination. In: Backhouse, R., Crole, R., Gibbons, J. (eds) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Lecture Notes in Computer Science, vol 2297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47797-7_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-47797-7_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47797-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation