COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS

DOI10.1142/S0129054190000138MaRDI QIDQ3358239zbMATH OpenOpenAlexFDO

Authors Franco Barbanera

Publication date 1990

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054190000138

zbMATH Keywords

\(\lambda \) - calculusconfluenceintersection typesStrong normalizationterm rewritingtype assignment

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Thue and Post systems, etc. (03D03) General topics in the theory of software (68N01) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 512772
• scientific article; zbMATH DE number 4124996
• Approximation and normalization results for typeable term rewriting systems
• Termination of combined (rewrite and λ-calculus) systems
• Intersection type assignment systems with higher-order algebraic rewriting

Cited in

(21)

• Confluence of the lambda calculus with left-linear algebraic rewriting
• Combining type disciplines
• Variants of the basic calculus of constructions
• Normal forms in combinatory logic
• An insertion operator preserving infinite reduction sequences
• scientific article; zbMATH DE number 51605 (Why is no real title available?)
• scientific article; zbMATH DE number 4124996 (Why is no real title available?)
• scientific article; zbMATH DE number 512770 (Why is no real title available?)
• scientific article; zbMATH DE number 512772 (Why is no real title available?)
• On modular properties of higher order extensional lambda calculi
• Modularity of termination and confluence in combinations of rewrite systems with _
• Approximation and normalization results for typeable term rewriting systems
• scientific article; zbMATH DE number 883895 (Why is no real title available?)
• More problems in rewriting
• Problems in rewriting III
• On the power of simple diagrams
• Addressed term rewriting systems: application to a typed object calculus
• Congruence types
• Rewriting with extensional polymorphic \(\lambda \)-calculus
• Lambda-definable term rewriting systems
• Intersection type assignment systems with higher-order algebraic rewriting

Describes a project that uses

Uses Software

• Miranda

This page was built for publication: COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS

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