Relating Higher-order and First-order Rewriting

DOI10.1093/LOGCOM/EXI050MaRDI QIDQ3371149zbMATH OpenOpenAlexFDO

Authors Eduardo Bonelli, Delia Kesner, A. Ríos

Publication date 21 February 2006

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exi050

zbMATH Keywords

explicit substitutions

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Processes, Terms and Cycles: Steps on the Road to Infinity
• scientific article; zbMATH DE number 1405629
• From nominal to higher-order rewriting and back again
• Rewriting, and equational unification: the higher-order cases
• scientific article; zbMATH DE number 1552533

Cited in

(1)

• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility

This page was built for publication: Relating Higher-order and First-order Rewriting

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