Developing developments
From MaRDI portal
Publication:1392147
DOI10.1016/S0304-3975(96)00173-9zbMATH Open0903.68104MaRDI QIDQ1392147FDOQ1392147
Authors: Vincent van Oostrom
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Combinatory reduction systems: Introduction and survey
- The lambda calculus, its syntax and semantics
- Title not available (Why is that?)
- Some Properties of Conversion
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logic programming language with lambda-abstraction, function variables, and simple unification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Development closed critical pairs
- Tree-Manipulating Systems and Church-Rosser Theorems
- Confluence without termination via parallel critical pairs
- Title not available (Why is that?)
- Developing developments
- The Clausal Theory of Types
- A set of postulates for the foundation of logic. II
- On the Church-Rosser property for the direct sum of term rewriting systems
- Context rewriting
- Residual theory in λ-calculus: a formal development
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulating expansions without expansions
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Closed categories and the theory of proofs
- Typed lambda calculi and applications. International conference, TLCA '93, March 16--18, 1993, Utrecht, the Netherlands. Proceedings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Confluence and superdevelopments
- Title not available (Why is that?)
- Reductions of Residuals are Finite
- Interaction systems II: The practice of optimal reductions
- Interaction Systems I: The theory of optimal reductions
- Title not available (Why is that?)
Cited In (24)
- Title not available (Why is that?)
- 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)
- Formalizing the confluence of orthogonal rewriting systems
- Labelings for decreasing diagrams
- CoLL: a confluence tool for left-linear term rewrite systems
- Descendants and origins in term rewriting.
- Development closed critical pairs
- Proving Confluence of Term Rewriting Systems Automatically
Uses Software
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)