Transformations of Conditional Rewrite Systems Revisited

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-03429-9_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Normalization Results for Typeable Rewrite Systems

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1997English

Graph Rewrite Systems for Program Optimization

ACM Transactions on Programming Languages and Systems
Software
2000English

Recognizability of Redexes for Higher-Order Rewrite Systems

IPSJ Online Transactions
2009English

Narrowing Strategies for Arbitrary Canonical Rewrite Systems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1995English

When Are Two Rewrite Systems More Than None?

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Higher-Order Unification Revisited: Complete Sets of Transformations

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1989English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Symmetric Diophantine Systems Revisited

Acta Arithmetica
Number TheoryAlgebra
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy