Intersection type assignment systems with higher-order algebraic rewriting

DOI10.1016/S0304-3975(96)80706-7zbMATH Open0874.03016OpenAlexW4234327515MaRDI QIDQ672048FDOQ672048

Authors: Franco Barbanera, Maribel Fernández 

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)80706-7

Recommendations

• scientific article; zbMATH DE number 512772
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• scientific article; zbMATH DE number 1696608
• scientific article; zbMATH DE number 512770
• scientific article; zbMATH DE number 883895

zbMATH Keywords

completenessstrong normalizationtype assignmentintersection typesextensions of \(\lambda\)-calculi with algebraic rewriting

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Edinburgh LCF. A mechanized logic of computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• An extension of basic functionality theory for \(\lambda\)-calculus
• Combinatory reduction systems: Introduction and survey
• On theories with a combinatorial definition of 'equivalence'
• A filter lambda model and the completeness of type assignment
• Title not available (Why is that?)
• Comparing curried and uncurried rewriting
• Title not available (Why is that?)
• The heart of intersection type assignment: Normalisation proofs revisited
• Counterexamples to termination for the direct sum of term rewriting systems
• Typing and computational properties of lambda expressions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On termination of the direct sum of term-rewriting systems
• Polymorphic rewriting conserves algebraic strong normalization
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• Modularity of strong normalization in the algebraic-λ-cube

Cited In (9)

• The algebra of expansion
• Intersection type assignment systems
• On modular properties of higher order extensional lambda calculi
• Inhabitation in Intersection and Union Type Assignment Systems
• Principal types for nominal theories
• A metamodel of access control for distributed environments: applications and properties
• Title not available (Why is that?)
• Nominal rewriting
• Title not available (Why is that?)

This page was built for publication: Intersection type assignment systems with higher-order algebraic rewriting

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