scientific article; zbMATH DE number 7566074
From MaRDI portal
Publication:5094148
Recommendations
- Modular term rewriting systems and the termination
- Generalized sufficient conditions for modular termination of rewriting
- On the modularity of termination of term rewriting systems
- Modular verification of programs with effects and effects handlers
- Modular termination of \(r\)-consistent and left-linear term rewriting systems
- Modular termination of prefix-constrained term rewrite systems
- Modularity in term rewriting revisited
- Modular termination of basic narrowing and equational unification
- scientific article; zbMATH DE number 4123320
- Termination Modulo Combinations of Equational Theories
Cites work
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Algebraic effects, linearity, and quantum programming languages
- An algebraic presentation of predicate logic (extended abstract)
- Associated type synonyms
- Associated types with class
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Counterexamples to termination for the direct sum of term rewriting systems
- Definitions by rewriting in the Calculus of Constructions
- Dependency pairs termination in dependent type theory modulo rewriting
- Generalized sufficient conditions for modular termination of rewriting
- Handlers in action
- Handling algebraic effects
- Harnessing first order termination provers using higher order dependency pairs
- How to prove decidability of equational theories with second-order computation analyser SOL
- scientific article; zbMATH DE number 1615229 (Why is no real title available?)
- scientific article; zbMATH DE number 996558 (Why is no real title available?)
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- Inductive-data-type systems
- Instances of computational effects: an algebraic perspective
- Modular proofs for completeness of hierarchical term rewriting systems
- Modular termination proofs for rewriting using dependency pairs
- Modularity of simple termination of term rewriting systems with shared constructors
- Modularity of strong normalization in the algebraic-λ-cube
- Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
- Normal higher-order termination
- On the Church-Rosser property for the direct sum of term rewriting systems
- On the modularity of termination of term rewriting systems
- Polymorphic higher-order recursive path orderings
- Polymorphic higher-order termination
- Polymorphic rewrite rules: confluence, type inference, and instance validation
- Polymorphic rewriting conserves algebraic strong normalization
- Programming Languages and Systems
- Second-Order Algebraic Theories
- Second-Order Equational Logic (Extended Abstract)
- Semantic labelling for proving termination of combinatory reduction systems
- Substitution, jumps, and algebraic effects
- Term Rewriting and Applications
- Termination by absence of infinite chains of dependency pairs
- Termination for direct sums of left-linear complete term rewriting systems
- Termination of constructor systems
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Termination of term rewriting using dependency pairs
- The computability path ordering
- Transforming termination by self-labelling
- Two cotensors in one: presentations of algebraic theories for local state and fresh names
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094148)
