Computational semantics of term rewriting systems
Algebraic methods in semantics
Confluence results for the pure strong categorical logic CCL. &lgr;-calculi as subsystems of CCL
Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
Handbook of logic in computer science (vol. 4)
Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Towards a proof theory of rewriting: the simply typed 2&lgr;-calculus
Theoretical Computer Science
Term rewriting and all that
Strong Normalization of Substitutions
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Typed lambda-calculi with explicit substitutions may not terminate
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Stability and Sequentiality in Dataflow Networks
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Axiomatic Rewriting Theory VI Residual Theory Revisited
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A Factorisation Theorem in Rewriting Theory
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Stability Theorem in Rewriting Theory
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Categories of asynchronous systems
Categories of asynchronous systems
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
By extending nondeterministic transition systems with concurrency and copy mechanisms, Axiomatic Rewriting Theory provides a uniform framework for a variety of rewriting systems, ranging from higher-order systems to Petri nets and process calculi. Despite its generality, the theory is surprisingly simple, based on a mild extension of transition systems with independence: an axiomatic rewriting system is defined as a 1-dimensional transition graph $\mathcal{G}$ equipped with 2-dimensional transitions describing the redex permutations of the system, and their orientation. In this article, we formulate a series of elementary axioms on axiomatic rewriting systems, and establish a diagrammatic standardization theorem.