Datatype defining rewrite systems for naturals and integers
A datatype defining rewrite system (DDRS) is an algebraic (equational) specification intended to specify a datatype. When interpreting the equations from left-to-right, a DDRS defines a term rewriting system that must be ground-complete. First we define two DDRSs for the ring of integers, each compr...
Main Authors: | Jan A. Bergstra, Alban Ponse |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2021-02-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/6031/pdf |
Similar Items
-
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
by: Takahito Aoto, et al.
Published: (2012-03-01) -
Monotonicity Constraints for Termination in the Integer Domain
by: Amir M. Ben-Amram
Published: (2011-08-01) -
A Rewriting View of Simple Typing
by: Aaron Stump, et al.
Published: (2013-02-01) -
Transforming Outermost into Context-Sensitive Rewriting
by: Joerg Endrullis, et al.
Published: (2010-06-01) -
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
by: Makoto Hamana
Published: (2017-11-01)