scientific article; zbMATH DE number 512788

zbMath0789.68081MaRDI QIDQ4281481

Tobias Nipkow

Publication date: 10 March 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

confluencehigher-order rewrite systemssimply typed lambda-terms

Mathematics Subject Classification ID

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

Related Items (13)

Reduction and unification in lambda calculi with a general notion of subtype ⋮ Confluence and superdevelopments ⋮ Higher-order families ⋮ Expressing combinatory reduction systems derivations in the rewriting calculus ⋮ Higher-order rewrite systems and their confluence ⋮ Developing developments ⋮ Development closed critical pairs ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ Descendants and origins in term rewriting. ⋮ Higher-order substitutions ⋮ Perpetuality and uniform normalization in orthogonal rewrite systems ⋮ Combinatory reduction systems: Introduction and survey ⋮ Relative normalization in Deterministic Residual Structures

This page was built for publication: