Confluence of Curried Term-Rewriting Systems

Journal of Symbolic Computation - United States
doi 10.1006/jsco.1995.1035
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Comparing Curried and Uncurried Rewriting

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1996English

On the Modularity of Confluence in Infinitary Term Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Context Term Calculus for Rewriting Systems

PROBLEMS IN PROGRAMMING
2018English

Hardware Synthesis From Term Rewriting Systems

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2000English

Transfinite Reductions in Orthogonal Term Rewriting Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy