How to normalize the Jay

DOI10.1016/S0304-3975(00)00379-0zbMath0974.68076MaRDI QIDQ5940936

Thomas Studer, Dieter Probst

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Combinatory logicStrong normalizationTerm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

The combinator M and the Mockingbird lattice, Mockingbird lattices

Cites Work

• Unnamed Item
• A mathematical logic without variables. I
• Termination for direct sums of left-linear complete term rewriting systems