Descendants and origins in term rewriting.

DOI10.1006/inco.2000.2876zbMath1046.68564OpenAlexW2104073699MaRDI QIDQ1854348

Inge Bethke, Roel de Vrijer, Jan Willem Klop

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b49f29a5ee00613cfa6b046b0ad680663dcccfb1

zbMATH Keywords

\(\lambda\)-calculusdescendantsresiduals

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ Braids via term rewriting ⋮ Exploring conditional rewriting logic computations ⋮ Clocks for Functional Programs ⋮ Memory Policy Analysis for Semantics Specifications in Maude ⋮ Normalisation for higher-order calculi with explicit substitutions ⋮ Backward Trace Slicing for Rewriting Logic Theories ⋮ Applications of infinitary lambda calculus ⋮ Clocked lambda calculus

Uses Software

• Haskell
• Miranda
• Automath

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Needed reduction and spine strategies for the lambda calculus
• Computing in systems described by equations
• Full abstraction in the lazy lambda calculus
• Rewriting techniques and applications. 10th international conference, RTA-99. Trento, Italy, July 2--4, 1999. Proceedings
• Combinatory reduction systems: Introduction and survey
• Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
• Infinitary lambda calculus
• Developing developments
• Transfinite reductions in orthogonal term rewriting systems
• On theories with a combinatorial definition of 'equivalence'
• Discrete Normalization and Standardization in Deterministic Residual Structures
• A direct proof of the finite developments theorem
• An abstract Church-Rosser theorem. II: Applications
• The Equivalence of Complete Reductions
• The geometry of orthogonal reduction spaces
• Finite family developments
• Confluence and superdevelopments
• Optimal normalization in orthogonal term rewriting systems
• Infinitary lambda calculi and böhm models
• An Abstract form of the church-rosser theorem. I
• Some Properties of Conversion
• Relative normalization in Deterministic Residual Structures
• Extended term rewriting systems
• Parallel reductions in \(\lambda\)-calculus
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item