Skip to main content
SpringerLink
Log in

First-Order Formative Rules

  • Conference paper
Rewriting and Typed Lambda Calculi (RTA 2014, TLCA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8560))

Abstract

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof. Compared to the higher-order definition, the first-order setting allows for significant improvements of the technique.

Support by EPSRC & the Austrian Science Fund (FWF) international project I963.

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. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: SAT solving for termination proofs with recursive path orders and dependency pairs. Journal of Automated Reasoning 49(1), 53–93 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dershowitz, N.: Termination by abstraction. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 1–18. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Fuhs, C., Giesl, J., Parting, M., Schneider-Kamp, P., Swiderski, S.: Proving termination by dependency pairs and inductive theorem proving. Journal of Automated Reasoning 47(2), 133–160 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fuhs, C., Kop, C.: First-order formative rules. Technical Report arXiv:1404.7695 [cs.LO] (2014), http://arxiv.org/abs/1404.7695

  6. Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S., Thiemann, R.: Proving termination of programs automatically with AProVE. In: Proc. IJCAR (to appear, 2014)

    Google Scholar 

  7. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 301–331. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 216–231. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37(3), 155–203 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation 205(4), 474–511 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kop, C.: Higher Order Termination. PhD thesis, Vrije Univ. Amsterdam (2012)

    Google Scholar 

  12. Kop, C., van Raamsdonk, F.: Higher order dependency pairs for algebraic functional systems. In: Schmidt-Schauß, M. (ed.) RTA 2011. LIPIcs, vol. 10, pp. 203–218. Dagstuhl Publishing (2011)

    Google Scholar 

  13. Kop, C., van Raamsdonk, F.: Dynamic dependency pairs for algebraic functional systems. Logical Methods in Computer Science 8(2) (2012)

    Google Scholar 

  14. Lankford, D.: On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University (1979)

    Google Scholar 

  15. Tannen, V., Gallier, G.H.: Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science 83(1), 3–28 (1991)

    Article  MATH  Google Scholar 

  16. Thiemann, R.: The DP framework for proving termination of term rewriting. PhD thesis, RWTH Aachen (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University College London, London, WC1E 6BT, UK

    Carsten Fuhs

  2. Institute of Computer Science, University of Innsbruck, 6020, Innsbruck, Austria

    Cynthia Kop

Authors
  1. Carsten Fuhs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cynthia Kop
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Inria, 23 avenue d’Italie, CS 81321, 75214, Paris Cedex 13, France

    Gilles Dowek

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Fuhs, C., Kop, C. (2014). First-Order Formative Rules. In: Dowek, G. (eds) Rewriting and Typed Lambda Calculi. RTA TLCA 2014 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham. https://doi.org/10.1007/978-3-319-08918-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08918-8_17

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08917-1

  • Online ISBN: 978-3-319-08918-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation