Recommendations
Cites work
- scientific article; zbMATH DE number 2185658 (Why is no real title available?)
- scientific article; zbMATH DE number 4208054 (Why is no real title available?)
- scientific article; zbMATH DE number 3811535 (Why is no real title available?)
- scientific article; zbMATH DE number 4055576 (Why is no real title available?)
- scientific article; zbMATH DE number 4106267 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 1255555 (Why is no real title available?)
- scientific article; zbMATH DE number 512788 (Why is no real title available?)
- scientific article; zbMATH DE number 512795 (Why is no real title available?)
- scientific article; zbMATH DE number 512797 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1499112 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- A logic programming language with lambda-abstraction, function variables, and simple unification
- A set of postulates for the foundation of logic. II
- Closed categories and the theory of proofs
- Combinatory reduction systems: Introduction and survey
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Confluence and superdevelopments
- Confluence without termination via parallel critical pairs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Context rewriting
- Developing developments
- Development closed critical pairs
- Interaction Systems I: The theory of optimal reductions
- Interaction systems II: The practice of optimal reductions
- On the Church-Rosser property for the direct sum of term rewriting systems
- Reductions of Residuals are Finite
- Residual theory in λ-calculus: a formal development
- Simulating expansions without expansions
- Some Properties of Conversion
- The Clausal Theory of Types
- The lambda calculus, its syntax and semantics
- Tree-Manipulating Systems and Church-Rosser Theorems
- Typed lambda calculi and applications. International conference, TLCA '93, March 16--18, 1993, Utrecht, the Netherlands. Proceedings
Cited in
(24)- Proving Confluence of Term Rewriting Systems Automatically
- scientific article; zbMATH DE number 7559275 (Why is no real title available?)
- Confluence by critical pair analysis revisited
- Confluence and superdevelopments
- Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
- Local confluence of conditional and generalized term rewriting systems
- CSI -- a confluence tool
- A Thread of HOL Development
- On modular properties of higher order extensional lambda calculi
- Decreasing diagrams and relative termination
- Decreasing diagrams and relative termination
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
- Confluence of orthogonal term rewriting systems in the prototype verification system
- Developing developments
- Certification of classical confluence results for left-linear term rewrite systems
- Compositional confluence criteria
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints
- Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs
- ProTeM: a proof term manipulator (system description)
- Labelings for decreasing diagrams
- Formalizing the confluence of orthogonal rewriting systems
- CoLL: a confluence tool for left-linear term rewrite systems
- Descendants and origins in term rewriting.
- Development closed critical pairs
This page was built for publication: Developing developments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392147)
