COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS

DOI10.1142/S0129054190000138zbMath0732.68061OpenAlexW1979913153MaRDI QIDQ3358239

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

confluenceStrong normalizationterm rewritingintersection typestype assignment\(\lambda \) - calculus

Mathematics Subject Classification ID

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

Related Items

Variants of the basic calculus of constructions, More problems in rewriting, Problems in rewriting III, On the power of simple diagrams, On modular properties of higher order extensional lambda calculi, Modularity of termination and confluence in combinations of rewrite systems with λω, Intersection type assignment systems with higher-order algebraic rewriting, Confluence of the lambda calculus with left-linear algebraic rewriting

Uses Software

• Miranda