Combinatory reduction systems with explicit substitution that preserve strong normalisation

DOI10.1007/3-540-61464-8_51zbMATH Open1503.68089OpenAlexW2126650211MaRDI QIDQ5055859FDOQ5055859

Authors: Roel Bloo, Kristoffer H. Rose 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61464-8_51

Recommendations

• scientific article; zbMATH DE number 1070568
• scientific article; zbMATH DE number 1342288
• Explicit substitution. On the edge of strong normalization
• \(\lambda\)-calculi with explicit substitutions preserving strong normalization
• Normalisation for higher-order calculi with explicit substitutions

Mathematics Subject Classification ID

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

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Combinatory reduction systems: Introduction and survey
• Title not available (Why is that?)
• The Mechanical Evaluation of Expressions
• Title not available (Why is that?)
• Explicit substitutions
• Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit cyclic substitutions

Cited In (5)

• Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
• Explicit substitution. On the edge of strong normalization
• Pattern matching as cut elimination
• Title not available (Why is that?)
• Comparing and implementing calculi of explicit substitutions with eta-reduction

Uses Software

• Automath

This page was built for publication: Combinatory reduction systems with explicit substitution that preserve strong normalisation

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