Skip to main content
SpringerLink
Log in

Rewriting Conversions Implemented with Continuations

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We give a continuation-based implementation of rewriting for systems in the LCF tradition. These systems must construct explicit proofs of equations when rewriting, and currently do so in a way that can be very space-inefficient. An explicit representation of continuations improves performance on large terms, and on long-running computations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barras, B.: Programming and computing in HOL. In: Aagard, M., Harrison, J. (eds.) Theorem Proving in Higher Order Logics, 13th International Conference, TPHOLs 2000. Lecture Notes in Computer Science, vol. 1869, pp. 17–37. Springer, New York (2000)

    Chapter  Google Scholar 

  2. Benton, N., Kennedy, A.: Exceptional syntax. J. Funct. Program. 11(4), 395–410 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bishop, S., Fairbairn, M., Norrish, M., Sewell, P., Smith, M., Wansbrough, K.: Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations. In: POPL’06: Conference Record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 55–66. ACM, New York (2006)

    Chapter  Google Scholar 

  4. Boulton, R.J.: Transparent optimisation of rewriting combinators. J. Funct. Program. 9(2), 113–146 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chrząszcz, J., Walukiewicz-Chrząszcz, D.: Towards rewriting in Coq. In: Comon-Lundh, H., Kirchner, C., Kirchner, H. (eds.) Rewriting, Computation and Proof: Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday. Lecture Notes in Computer Science, vol. 4600, pp. 113–131. Springer, New York (2007)

    Google Scholar 

  6. Gordon, M.J.C., Melham, T. (eds.): Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)

    MATH  Google Scholar 

  7. Harrison, J.: HOL Light: a tutorial introduction. In: Srivas, M., Camilleri, A. (eds.) Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD’96). Lecture Notes in Computer Science, vol. 1166, pp. 265–269. Springer, New York (1996)

    Chapter  Google Scholar 

  8. HOL: HOL website. http://hol.sourceforge.net (2009)

  9. Jones, R.B.: ICL ProofPower. BCS-FACS FACTS, Series III 1(1), 10–13 (1992)

    Google Scholar 

  10. Martin, H.W., Orr, B.J.: A random binary tree generator. In: CSC ’89: Proceedings of the 17th Annual Computer Science Conference, pp. 33–38. ACM, New York (1989)

    Google Scholar 

  11. Paulson, L.: A higher-order implementation of rewriting. Sci. Comput. Program. 3(2), 119–149 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  12. Paulson, L.C.: Isabelle: A Generic Theorem Prover. Lecture Notes in Computer Science, vol. 828. Springer, Berlin (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Canberra Research Lab., NICTA, PO Box 8001, Canberra, ACT 2601, Australia

    Michael Norrish

Authors
  1. Michael Norrish
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Norrish.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Norrish, M. Rewriting Conversions Implemented with Continuations. J Autom Reasoning 43, 305–336 (2009). https://doi.org/10.1007/s10817-009-9146-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-009-9146-5

Keywords

Search

Navigation