(Head-)normalization of typeable rewrite systems

DOI10.1007/3-540-59200-8_64zbMATH Open1503.68163OpenAlexW1512701877MaRDI QIDQ5055837FDOQ5055837

Maribel Fernández, Steffen Van Bakel

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-59200-8_64

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatory logic. With two sections by William Craig.
• A filter lambda model and the completeness of type assignment
• Complete restrictions of the intersection type discipline
• Intensional interpretations of functionals of finite type I
• Modularity of strong normalization in the algebraic-λ-cube

Cited In (2)

• Approximation and normalization results for typeable term rewriting systems
• Normalization results for typeable rewrite systems

Recommendations

• Normalization results for typeable rewrite systems 👍 👎
• Typed Applicative Structures and Normalization by Evaluation for System F ω 👍 👎
• Approximation and normalization results for typeable term rewriting systems 👍 👎
• Strong normalization in type systems: A model theoretical approach 👍 👎
• Normalization by evaluation for modal dependent type theory 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: (Head-)normalization of typeable rewrite systems

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