Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved

DOI10.1007/3-540-54317-1_96MaRDI QIDQ5881282zbMATH OpenOpenAlexFDO

Authors Franco Barbanera

Publication date 9 March 2023

Published in Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54317-1_96

Mathematics Subject Classification ID

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

Recommendations

• Polymorphic rewriting conserves algebraic strong normalization
• scientific article; zbMATH DE number 4124996
• Termination of rewriting in the Calculus of Constructions
• Adding algebraic rewriting to the untyped lambda calculus
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)

Cites work

• Functional Characters of Solvable Terms
• Polymorphic rewriting conserves algebraic strong normalization
• The calculus of constructions

Cited in

(10)

• Polymorphic rewriting conserves algebraic strong normalization
• Variants of the basic calculus of constructions
• The Computability Path Ordering: The End of a Quest
• scientific article; zbMATH DE number 4124996 (Why is no real title available?)
• Termination of rewriting in the Calculus of Constructions
• Modularity of termination and confluence in combinations of rewrite systems with _
• Modular properties of algebraic type systems
• Definitions by rewriting in the Calculus of Constructions
• scientific article; zbMATH DE number 1418375 (Why is no real title available?)
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)

This page was built for publication: Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved

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