Intersection type assignment systems with higher-order algebraic rewriting

DOI10.1016/S0304-3975(96)80706-7MaRDI QIDQ672048zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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
• scientific article; zbMATH DE number 512772 (Why is no real title available?)
• Nominal rewriting
• scientific article; zbMATH DE number 1696608 (Why is no real title available?)

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)