Information and Computation · 1994 · 33 citations · 24 references
ComputingComputer ScienceMathematicsAlgebraFormal MethodsProgramming LanguagesModel TheoryRecursion TheoryType SystemsLambda CalculusNormal FormsRewrite SystemsRewriting SystemsTerm RewritingTerm Rewriting SystemsTyped Lambda Calculus
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to the polymorphic lambda calculus as higher-order constants. We show that if a many-sorted algebraic rewrite system R has the Church-Rosser property (is confluent), then R + β + type-β + type-η rewriting of mixed terms has the Church-Rosser property too. η reduction does not commute with algebraic reduction, in general. However, using long normal forms, we show that if R is canonical (confluent and strongly normalizing) then equational provability from R + β + η type-β + type-η is still decidable.
24
Introduction to Higher Order Categorical Logic.
J. L. Bell, J. Lambek, Philip Scott · Journal of Symbolic Logic · 1989 · 1.1K citations
Humanities, Mathematics, Logic +11
Thierry Coquand, Gérard Huet · Information and Computation · 1988 · 1.1K citations · Full text
A unification algorithm for typed λ-calculus
G. Huet · Theoretical Computer Science · 1975 · 509 citations
Completeness of many-sorted equational logic
Joseph A. Goguen, José Meseguer · ACM SIGPLAN Notices · 1981 · 212 citations