Normalization results for typeable rewrite systems

DOI10.1006/inco.1996.2617zbMath0877.68072OpenAlexW2043802386MaRDI QIDQ1357006

Steffen van Bakel, Maribel Fernández

Publication date: 16 June 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1ee513e730f6908fce63b983b11930a253757032

zbMATH Keywords

Curryfied term rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Nominal essential intersection types, Uncurrying for termination and complexity, Semantic types and approximation for Featherweight Java, Unnamed Item, A metamodel of access control for distributed environments: applications and properties, The heart of intersection type assignment: Normalisation proofs revisited, Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming, Functional Type Assignment for Featherweight Java, A liberal type system for functional logic programs, Cut-elimination in the strict intersection type assignment system is strongly normalizing, Principal Types for Nominal Theories, Normalization, approximation, and semantics for combinator systems

Uses Software

• ML
• CLEAN
• Miranda

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• An extension of basic functionality theory for \(\lambda\)-calculus
• Complete restrictions of the intersection type discipline
• Intersection types for combinatory logic
• A theory of type polymorphism in programming
• Intersection type assignment systems
• LEAN: An intermediate language based on graph rewriting
• Confluence of curried term-rewriting systems
• Comparing curried and uncurried rewriting
• A filter lambda model and the completeness of type assignment
• Modularity of strong normalization in the algebraic-λ-cube
• Principal Type Schemes for the Strict Type Assignment System
• Intensional interpretations of functionals of finite type I
• The Principal Type-Scheme of an Object in Combinatory Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item