scientific article; zbMATH DE number 4124996
From MaRDI portal
Publication:4205074
zbMath0686.68022MaRDI QIDQ4205074
Jean H. Gallier, Val Breazu-Tannen
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polymorphic lambda calculusdata type specificationsterm rewriting systemsChurch-Rosser propertymany sorted algebraalgebraic equational theories
Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Data structures (68P05) Algebraic structures (08A99) Combinatory logic and lambda calculus (03B40) Thue and Post systems, etc. (03D03)
Related Items (18)
Inductively defined types in the Calculus of Constructions ⋮ Modular higher-order E-unification ⋮ On confluence for weakly normalizing systems ⋮ More problems in rewriting ⋮ Problems in rewriting III ⋮ Size-based termination of higher-order rewriting ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Internal models of system F for decompilation ⋮ A rationale for conditional equational programming ⋮ Polymorphic rewriting conserves algebraic strong normalization ⋮ Confluence of the lambda calculus with left-linear algebraic rewriting ⋮ Adding algebraic rewriting to the untyped lambda calculus ⋮ Unnamed Item ⋮ On the confluence of lambda-calculus with conditional rewriting ⋮ Inductive-data-type systems ⋮ Synthesis of rewrite programs by higher-order and semantic unification ⋮ Equational type logic ⋮ Combinatory reduction systems: Introduction and survey
This page was built for publication:
