Descendants and origins in term rewriting.
type: Item
instance of: scholarly article
title: Descendants and origins in term rewriting.
zbMATH Open document ID: 1046.68564
author: Inge Bethke
author: Jan Willem Klop
author: Roel de Vrijer
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 1853106
zbMATH Keywords: descendants
zbMATH Keywords: residuals
zbMATH Keywords: \(\lambda\)-calculus
describes a project that uses: Miranda
describes a project that uses: Automath
describes a project that uses: Haskell
MaRDI profile type: Publication
OpenAlex ID: W2104073699
cites work: Full abstraction in the lazy lambda calculus
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Q4182476
cites work: Needed reduction and spine strategies for the lambda calculus
cites work: Q3837724
cites work: Q3205213
cites work: Q4287785
cites work: Q3750994
cites work: Some Properties of Conversion
cites work: Q5287527
cites work: Q5565113
cites work: Q4385532
cites work: Q4205073
cites work: Relative normalization in Deterministic Residual Structures
cites work: An Abstract form of the church-rosser theorem. I
cites work: An abstract Church-Rosser theorem. II: Applications
cites work: The Equivalence of Complete Reductions
cites work: Q4297316
cites work: Q5287535
cites work: Infinitary lambda calculi and böhm models
cites work: Transfinite reductions in orthogonal term rewriting systems
cites work: Infinitary lambda calculus
cites work: Q4259973
cites work: Q3202988
cites work: Optimal normalization in orthogonal term rewriting systems
cites work: Discrete Normalization and Standardization in Deterministic Residual Structures
cites work: The geometry of orthogonal reduction spaces
cites work: Q4222804
cites work: Q3918095
cites work: Q3805891
cites work: Combinatory reduction systems: Introduction and survey
cites work: Extended term rewriting systems
cites work: Q4274979
cites work: Q4101795
cites work: Q4362960
cites work: Q4936122
cites work: On theories with a combinatorial definition of 'equivalence'
cites work: Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
cites work: Q4281481
cites work: Computing in systems described by equations
cites work: Developing developments
cites work: Finite family developments
cites work: Rewriting techniques and applications. 10th international conference, RTA-99. Trento, Italy, July 2--4, 1999. Proceedings
cites work: Q4501166
cites work: Q3780427
cites work: Confluence and superdevelopments
cites work: Parallel reductions in \(\lambda\)-calculus
cites work: Q3721784
cites work: A direct proof of the finite developments theorem
cites work: Q3202990
DOI: 10.1006/INCO.2000.2876
description: scientific article; zbMATH DE number 1853106