COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS

DOI10.1142/S0129054190000138zbMATH Open0732.68061OpenAlexW1979913153MaRDI QIDQ3358239FDOQ3358239

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

Recommendations

• scientific article; zbMATH DE number 512772
• Publication:4205074
• 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

zbMATH Keywords

confluenceterm rewritingtype assignmentintersection types\(\lambda \) - calculusStrong normalization

Mathematics Subject Classification ID

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

Cited In (14)

• Title not available (Why is that?)
• Normal forms in combinatory logic
• Variants of the basic calculus of constructions
• On modular properties of higher order extensional lambda calculi
• Confluence of the lambda calculus with left-linear algebraic rewriting
• Addressed term rewriting systems: application to a typed object calculus
• On the power of simple diagrams
• More problems in rewriting
• An insertion operator preserving infinite reduction sequences
• Intersection type assignment systems with higher-order algebraic rewriting
• Combining type disciplines
• Title not available (Why is that?)
• Modularity of termination and confluence in combinations of rewrite systems with λω
• Problems in rewriting III

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)