Delaying unification algorithms for lambda calculi

DOI10.1016/0304-3975(88)90135-1zbMATH Open0647.68092OpenAlexW2088369130MaRDI QIDQ1104776FDOQ1104776

Authors: John Staples 

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90135-1

Recommendations

• A UNIFICATION ALGORITHM FOR THE λΠ-CALCULUS
• Unification for \(\lambda\)-calculi without propagation rules
• scientific article; zbMATH DE number 1303341
• Unifying lazy and strict computations
• Theorem proving for untyped constructive \(\lambda\)-calculus: Implementation and application
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• scientific article; zbMATH DE number 3997190
• The lazy lambda calculus in a concurrency scenario
• Initial algebra semantics for lambda calculi
• scientific article; zbMATH DE number 3933030

zbMATH Keywords

lambda calculusunificationrewriting systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatory logic and lambda calculus (03B40)

Cites Work

• A unification algorithm for typed \(\overline\lambda\)-calculus
• Efficient unification of quantified terms
• Structure sharing for quantified terms: Fundamentals
• Graph reduction. Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29 - October 1, 1986

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Delaying unification algorithms for lambda calculi

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