Approximation and normalization results for typeable term rewriting systems
From MaRDI portal
Publication:4645802
DOI10.1007/3-540-61254-8_17zbMath1407.68243OpenAlexW2131954980MaRDI QIDQ4645802
Steffen van Bakel, Maribel Fernández
Publication date: 11 January 2019
Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61254-8_17
Related Items
The heart of intersection type assignment: Normalisation proofs revisited ⋮ Strongly Normalising Cut-Elimination with Strict Intersection Types ⋮ Normalization, approximation, and semantics for combinator systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatory logic. With two sections by William Craig.
- Full abstraction and limiting completeness in equational languages
- An extension of basic functionality theory for \(\lambda\)-calculus
- Complete restrictions of the intersection type discipline
- Intersection types for combinatory logic
- Typing and computational properties of lambda expressions
- Meaningless terms in rewriting
- A filter lambda model and the completeness of type assignment
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Principal Type Schemes for the Strict Type Assignment System
- (Head-)normalization of typeable rewrite systems
- Intensional interpretations of functionals of finite type I
