Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Modularity of confluence: a simplified proof

Published: 28 January 1994 Publication History

Abstract

No abstract available.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Information Processing Letters
Information Processing Letters  Volume 49, Issue 2
Jan. 28, 1994
48 pages
ISSN:0020-0190
Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 28 January 1994

Author Tags

  1. term rewriting systems
  2. theory of computation

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)Modular Properties of Composable Term Rewriting SystemsJournal of Symbolic Computation10.1006/jsco.1995.103620:1(1-41)Online publication date: 3-Jan-2019
  • (2015)Layer Systems for Proving ConfluenceACM Transactions on Computational Logic10.1145/271001716:2(1-32)Online publication date: 9-Mar-2015
  • (2008)Modularity of ConfluenceProceedings of the 4th international joint conference on Automated Reasoning10.1007/978-3-540-71070-7_31(348-363)Online publication date: 12-Aug-2008
  • (2006)Modular church-rosser moduloProceedings of the 17th international conference on Term Rewriting and Applications10.1007/11805618_8(96-107)Online publication date: 12-Aug-2006
  • (2006)Generalizing newman's lemma for left-linear rewrite systemsProceedings of the 17th international conference on Term Rewriting and Applications10.1007/11805618_6(66-80)Online publication date: 12-Aug-2006
  • (2005)Abstract modularityProceedings of the 16th international conference on Term Rewriting and Applications10.1007/978-3-540-32033-3_5(46-60)Online publication date: 19-Apr-2005
  • (2002)Modular termination of context-sensitive rewritingProceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/571157.571163(50-61)Online publication date: 6-Oct-2002
  • (2002)Relative undecidability in term rewritingInformation and Computation10.1016/S0890-5401(02)93150-0178:1(132-148)Online publication date: 10-Oct-2002

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media