Approximation and normalization results for typeable term rewriting systems

DOI10.1007/3-540-61254-8_17zbMATH Open1407.68243OpenAlexW2131954980MaRDI QIDQ4645802FDOQ4645802

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

Recommendations

• Normalization results for typeable rewrite systems
• (Head-)normalization of typeable rewrite systems
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• Normalization, approximation, and semantics for combinator systems
• scientific article; zbMATH DE number 512770

zbMATH Keywords

normal formapproximation theoremtype assignmentfunction symboltypeable term

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Combinatory logic. With two sections by William Craig.
• An extension of basic functionality theory for \(\lambda\)-calculus
• A filter lambda model and the completeness of type assignment
• Title not available (Why is that?)
• Complete restrictions of the intersection type discipline
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Intensional interpretations of functionals of finite type I
• Typing and computational properties of lambda expressions
• Title not available (Why is that?)
• Principal Type Schemes for the Strict Type Assignment System
• Intersection types for combinatory logic
• Full abstraction and limiting completeness in equational languages
• Meaningless terms in rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• (Head-)normalization of typeable rewrite systems

Cited In (8)

• Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
• Normalization properties for shallow TRS and innermost rewriting
• Term rewriting for normalization by evaluation.
• The heart of intersection type assignment: Normalisation proofs revisited
• Normalization, approximation, and semantics for combinator systems
• (Head-)normalization of typeable rewrite systems
• Strongly normalising cut-elimination with strict intersection types
• Normalization results for typeable rewrite systems

This page was built for publication: Approximation and normalization results for typeable term rewriting systems

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