Descendants and origins in term rewriting.

DOI10.1006/INCO.2000.2876MaRDI QIDQ1854348zbMATH OpenOpenAlexFDO

Authors Inge Bethke, Jan Willem Klop, Roel de Vrijer

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

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

Recommendations

• Computing with Infinite Terms and Infinite Reductions
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• Transfinite reductions in orthogonal term rewriting systems
• Parallel reductions in \(\lambda\)-calculus

Cites work

• A direct proof of the finite developments theorem
• An abstract Church-Rosser theorem. II: Applications
• An Abstract form of the church-rosser theorem. I
• Combinatory reduction systems: Introduction and survey
• Computing in systems described by equations
• Confluence and superdevelopments
• Developing developments
• Discrete normalization and standardization in deterministic residual structures
• Extended term rewriting systems
• Finite family developments
• Full abstraction in the lazy lambda calculus
• scientific article; zbMATH DE number 4179330 (Why is no real title available?)
• scientific article; zbMATH DE number 4179332 (Why is no real title available?)
• scientific article; zbMATH DE number 3646849 (Why is no real title available?)
• scientific article; zbMATH DE number 3951980 (Why is no real title available?)
• scientific article; zbMATH DE number 3988695 (Why is no real title available?)
• scientific article; zbMATH DE number 4043233 (Why is no real title available?)
• scientific article; zbMATH DE number 4074466 (Why is no real title available?)
• scientific article; zbMATH DE number 956467 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 3523519 (Why is no real title available?)
• scientific article; zbMATH DE number 3619856 (Why is no real title available?)
• scientific article; zbMATH DE number 4124993 (Why is no real title available?)
• scientific article; zbMATH DE number 1231495 (Why is no real title available?)
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• scientific article; zbMATH DE number 512788 (Why is no real title available?)
• scientific article; zbMATH DE number 551037 (Why is no real title available?)
• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1086711 (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 1392283 (Why is no real title available?)
• scientific article; zbMATH DE number 234028 (Why is no real title available?)
• scientific article; zbMATH DE number 234035 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• Infinitary lambda calculi and böhm models
• Infinitary lambda calculus
• Needed reduction and spine strategies for the lambda calculus
• On theories with a combinatorial definition of 'equivalence'
• Optimal normalization in orthogonal term rewriting systems
• Parallel reductions in \(\lambda\)-calculus
• Relative normalization in Deterministic Residual Structures
• Rewriting techniques and applications. 10th international conference, RTA-99. Trento, Italy, July 2--4, 1999. Proceedings
• Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
• Some Properties of Conversion
• The Equivalence of Complete Reductions
• The geometry of orthogonal reduction spaces
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Transfinite reductions in orthogonal term rewriting systems

Cited in

(12)

• Applications of infinitary lambda calculus
• Origin tracking
• Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
• Normalisation for higher-order calculi with explicit substitutions
• Braids via term rewriting
• scientific article; zbMATH DE number 1942460 (Why is no real title available?)
• scientific article; zbMATH DE number 2090069 (Why is no real title available?)
• Exploring conditional rewriting logic computations
• Backward trace slicing for rewriting logic theories
• Clocked lambda calculus
• Clocks for Functional Programs
• Memory policy analysis for semantics specifications in Maude

Describes a project that uses

Uses Software

• Miranda
• Automath
• Haskell

This page was built for publication: Descendants and origins in term rewriting.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854348)