Skip to main content
Log in

Confluence of Orthogonal Term Rewriting Systems in the Prototype Verification System

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

Abstract

Orthogonality is a discipline of programming which syntactically guarantees determinism of functional specifications. Essentially, orthogonality avoids critical forks in term rewriting systems (TRSs) twofold: avoiding overlappings between left-hand sides of the rules (non-ambiguity) prohibiting rules in the definitions of functions that may apply simultaneously and forbidding repetitions of variables in the left-hand side of the rules (left-linearity) that may produce forks. In the theory of term rewriting systems, determinism is captured by the well-known property of confluence that is a consequence of orthogonality. This work describes a complete formalization in PVS of the theorem of confluence of orthogonal term rewriting systems. The formalization includes definitions and results on parallel reduction, in particular Rosen’s Parallel Moves Lemma. It is made available as a PVS theory orthogonality inside the directory TRS of the NASA Langley PVS Library. Like all of TRS, orthogonality is intended to stay close to textbook proofs. The present proof uses the Parallel Moves Lemma at dominating positions of a parallel context. In this manner, all parallel forks filling the holes of the context are joined and, as result, a term of joinability for the whole fork is constructed.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Avelar, A., Galdino, A., de Moura, F., Ayala-Rincón, M.: First-order unification in the PVS proof assistant. Logic J. IGPL 22(5), 758–789 (2014)

    Article  MathSciNet  Google Scholar 

  2. Ayala-Rincón, M., Avelar, A.B., Galdino, A.L., Rocha-Oliveira, A.C.: TRS: a PVS Theory for Term Rewriting Systems. http://trs.cic.unb.br—Universidade de Brasília, and http://shemesh.larc.nasa.gov/fm/ftp/larc/PVS-library/library.html—NASA Langley Research Center PVS libraries (Last visited: August, 2015)

  3. Ayala-Rincón, M., Fernández, M., Gabbay, M.J., Rocha-Oliveira, A.C.: Checking overlaps of nominal rewriting rules. In Pre-proc. Logical and Semantic Frameworks with Applications (LSFA). ENTCS (2015)

  4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  5. Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  6. Galdino, A.L., Ayala-Rincón, M.: A formalization of Newman’s and Yokouchi’s lemmas in a higher-order language. J. Formal. Reason. 1(1), 39–50 (2008)

    MathSciNet  MATH  Google Scholar 

  7. Galdino, A.L., Ayala-Rincón, M.: A formalization of the Knuth–Bendix(–Huet) critical pair theorem. J. Autom. Reason. 45(3), 301–325 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Huet, G.P.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27(4), 797–821 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  9. Huet, G.P., Lévy, J.-J.: Computations in orthogonal rewriting systems, I. In: Computational Logic—Essays in Honor of Alan Robinson, pp. 395–414 (1991)

  10. Rocha-Oliveira, A.C., Ayala-Rincón, M.: Formalizing the confluence of orthogonal rewriting systems. In: Proceedings of 7th Workshop on Logical and Semantic Frameworks, with Applications, LSFA, pp. 145–152 (2012)

  11. Rosen, B.K.: Tree-manipulating systems and Church–Rosser theorems. J. ACM 20(1), 160–187 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  12. Shankar, N., Owre, S., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS Prover Guide. Technical report, SRI International. http://pvs.csl.sri.com/doc/pvs-prover-guide.pdf (2001)

  13. Suzuki, T., Kikuchi, K., Aoto, T., Toyama, Y.: Confluence of orthogonal nominal rewriting systems revisited. In: Proceedings of the 26th International Conference on Rewriting Techniques and Applications (RTA 2015), pp. 301–317. LIPIcs (2015)

  14. Takahashi, M.: Parallel reductions in lambda-calculus. Inf. Comput. 118(1), 120–127 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Thiemann, R.: Formalizing bounded increase. In: Interactive Theorem Proving—4th International Conference, ITP 2013, Rennes, France, July 22–26, 2013. Proceedings, pp. 245–260 (2013)

  16. van Oostrom, V.: Developing developments. Theor. Comput. Sci. 175(1), 159–181 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

A.C. Rocha Oliveira was supported by a scholarship of the Coordination for the Improvement of Higher Education Personnel of the Brazilian Education Ministry CAPES; A.L. Galdino by the Foundation for Research Support of the State of Goiás FAPEG and M. Ayala-Rincón Partially supported by the Brazilian National Counsel of Scientific and Technological Development CNPq.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mauricio Ayala-Rincón.

Additional information

Work supported by CNPq Universal Grant 476952/2013-1.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rocha-Oliveira, A.C., Galdino, A.L. & Ayala-Rincón, M. Confluence of Orthogonal Term Rewriting Systems in the Prototype Verification System. J Autom Reasoning 58, 231–251 (2017). https://doi.org/10.1007/s10817-016-9376-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-016-9376-2

Keywords

Navigation