Developing developments

DOI10.1016/S0304-3975(96)00173-9zbMath0903.68104MaRDI QIDQ1392147

Vincent van Oostrom

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

orthogonal rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (20)

Confluence of orthogonal term rewriting systems in the prototype verification system ⋮ CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems ⋮ Combining algebraic rewriting, extensional lambda calculi, and fixpoints ⋮ On modular properties of higher order extensional lambda calculi ⋮ Developing developments ⋮ Unnamed Item ⋮ Local confluence of conditional and generalized term rewriting systems ⋮ Decreasing diagrams and relative termination ⋮ Unnamed Item ⋮ Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem ⋮ Decreasing Diagrams and Relative Termination ⋮ Unnamed Item ⋮ CSI – A Confluence Tool ⋮ Confluence by critical pair analysis revisited ⋮ Proving Confluence of Term Rewriting Systems Automatically ⋮ Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems ⋮ The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type ⋮ Descendants and origins in term rewriting. ⋮ Labelings for decreasing diagrams ⋮ Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Typed lambda calculi and applications. International conference, TLCA '93, March 16--18, 1993, Utrecht, the Netherlands. Proceedings
• Closed categories and the theory of proofs
• The lambda calculus, its syntax and semantics
• Combinatory reduction systems: Introduction and survey
• Interaction systems II: The practice of optimal reductions
• Developing developments
• A set of postulates for the foundation of logic. II
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Reductions of Residuals are Finite
• Simulating expansions without expansions
• Interaction Systems I: The theory of optimal reductions
• Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
• Development closed critical pairs
• Residual theory in λ-calculus: a formal development
• A logic programming language with lambda-abstraction, function variables, and simple unification
• Confluence and superdevelopments
• On the Church-Rosser property for the direct sum of term rewriting systems
• Tree-Manipulating Systems and Church-Rosser Theorems
• Some Properties of Conversion
• Confluence without termination via parallel critical pairs
• Context rewriting
• The Clausal Theory of Types

This page was built for publication: Developing developments