Higher-Order Unification: A structural relation between Huet's method and the one based on explicit substitutions-Reference-Cited by-同舟云学术

Higher-Order Unification: A structural relation between Huet's method and the one based on explicit substitutions

Published:2008-03 Issue:1 Volume:6 Page:72-108
ISSN:1570-8683
Container-title:Journal of Applied Logic
language:en
Short-container-title:Journal of Applied Logic

Author:

de Moura Flávio L.C.,Ayala-Rincón Mauricio,Kamareddine Fairouz

Publisher

Elsevier BV

Subject

Applied Mathematics,Logic

Reference17 articles.

1. Explicit substitutions;Abadi;Journal of Functional Programming,1991

2. Unification via the λse-style of explicit substitution;Ayala-Rincón;The Logical Journal of the Interest Group in Pure and Applied Logics,2001

3. On applying the λse-style of unification for simply-typed higher order unification in the pure lambda calculus;Ayala-Rincón;Matemática Contemporânea,2003

4. Comparing and implementing calculi of explicit substitutions with eta-reduction;Ayala-Rincón;Annals of Pure and Applied Logic,2005

5. The Lambda Calculus: Its Syntax and Semantics;Barendregt,1984

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Restricted Combinatory Unification;Lecture Notes in Computer Science;2019

2. Unification for $$\lambda $$ -calculi Without Propagation Rules;Theoretical Aspects of Computing – ICTAC 2016;2016

3. On the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions;LATIN 2014: Theoretical Informatics;2014

4. A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi;Electronic Notes in Theoretical Computer Science;2011-04