Transfinite Reductions in Orthogonal Term Rewriting Systems

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-53904-2_81
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Confluence of Curried Term-Rewriting Systems

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1995English

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

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Critical Pairs in Term Graph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Simplification Orders for Term Graph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Term-Graph Rewriting via Explicit Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Term Rewriting Meets Aspect-Oriented Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy