Completeness of combinations of constructor systems
From MaRDI portal
Recommendations
- Completeness of combinations of constructor systems
- Completeness of combinations of conditional constructor systems
- A Fully Abstract Semantics for Constructor Systems
- Constructors, sufficient completeness, and deadlock freedom of rewrite theories
- scientific article; zbMATH DE number 408816
- Strong and NV-sequentiality of constructor systems
- Consistency and Completeness of Rewriting in the Calculus of Constructions
- Consistency and Completeness of Rewriting in the Calculus of Constructions
- scientific article; zbMATH DE number 4174908
Cites work
- scientific article; zbMATH DE number 4180808 (Why is no real title available?)
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4106267 (Why is no real title available?)
- scientific article; zbMATH DE number 3729436 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Modular aspects of properties of term rewriting systems related to normal forms
- Modular term rewriting systems and the termination
- Modularity of simple termination of term rewriting systems with shared constructors
- On termination of the direct sum of term-rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- On theories with a combinatorial definition of 'equivalence'
- Termination for the direct sum of left-linear term rewriting systems
Cited in
(12)- Modularity of simple termination of term rewriting systems with shared constructors
- Completeness of combinations of conditional constructor systems
- Decidability of reachability for disjoint union of term rewriting systems
- More problems in rewriting
- A Fully Abstract Semantics for Constructor Systems
- Constructors, sufficient completeness, and deadlock freedom of rewrite theories
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- scientific article; zbMATH DE number 3932374 (Why is no real title available?)
- Modularity of completeness revisited
- Interaction nets and term rewriting systems (extended abstract)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems
- Termination for direct sums of left-linear complete term rewriting systems
This page was built for publication: Completeness of combinations of constructor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055759)
