See this document in CiteSeerX!

Higher-order Unification via Explicit Substitutions (Extended Abstract) (1995)  (Make Corrections)  (61 citations)
Gilles Dowek, Thérèse Hardin, Claude Kirchner
Proceedings of the Tenth Annual Symposium on Logic in Computer Science



  Home/Search   Context   Related

 
View or download:
loria.fr/pub/loria...chnerLICS95.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fermivista.math.ju...ftp.loria.fr (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Higher-order unification is equational unification for βη-conversion. But it is not first-order equational unification, as substitution has to avoid capture. In this paper higher-order unification is reduced to first-order equational unification in a suitable theory: the λσ-calculus of explicit substitutions. (Update)

Cited by:   More
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005)   (Correct)
Unification via Explicit Substitutions: - The Case Of   (Correct)
A Modal Foundation for Meta-Variables - Aleksandar Nanevski Brigitte (2003)   (Correct)

Similar documents (at the sentence level):
16.0%:   Higher-order Unification via Explicit Substitutions - Dowek, Hardin, Kirchner (1995)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Unknown - Apport De Recherche   (Correct)
0.3:   Theorem Proving Modulo - Dowek, Hardin, Kirchner (1998)   (Correct)
0.2:   Oracle-Based Checking of Untrusted Software - Necula, Rahul (2001)   (Correct)

Similar documents based on text:   More   All
0.8:   M-rules: Adaptable Rules for Robustness in Unification-based.. - Steiner, Tsujii   (Correct)
0.7:   Generating Propagation Rules for Finite Domains via.. - Ringeissen, Monfroy   (Correct)
0.6:   Grammatical Inference as Unification - Nicolas (1999)   (Correct)

Related documents from co-citation:   More   All
27:   Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
20:   Confluence Properties for Weak and Strong Calculi of Explicit Substitutions - Curien, Hardin - 1996
19:   The Implementation of ALF---A Proof Editor Based on Martin-Lof's Monomorphic Typ.. - Magnusson - 1995

BibTeX entry:   (Update)

Gilles Dowek, Th`er'ese Hardin, and Claude Kirchner. Higher-order unification via explicit substitutions. In Tenth Annual IEEE Symposium on Logic in Computer Science, pages 366--374, San Diego, California, June 1995. IEEE Computer Society Press. http://citeseer.ist.psu.edu/article/dowek95higherorder.html   More

@inproceedings{ dowek95higherorder,
    author = "Gilles Dowek and Th{\'e}r{\`e}se Hardin and Claude Kirchner",
    title = "Higher-Order Unification via Explicit Substitutions",
    booktitle = "Proceedings of the Tenth Annual Symposium on Logic in Computer Science",
    month = "June",
    publisher = "IEEE Computer Society Press",
    address = "San Diego, California",
    editor = "D. Kozen",
    pages = "366--374",
    year = "1995",
    url = "citeseer.ist.psu.edu/article/dowek95higherorder.html" }
Citations (may not include all citations):
382   Lambda calculi with types - Barendregt - 1992
137   Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
125   Solving equations in abstract algebras: a rule-based survey .. (context) - Jouannaud, Kirchner - 1991
114   Building-in equational theories (context) - Plotkin - 1972
42   Resolution in type theory (context) - Andrews - 1971
32   Higherorder unication via explicit substitutions (context) - Dowek, Hardin et al. - 1994
25   Elsevier Science Publishers B (context) - Barendregt, its et al. - 1984
19   A complete proof synthesis method for the cube of type syste.. (context) - Dowek - 1993
15   Higher order unication revisited: Complete sets of tranforma.. (context) - Snyder, Gallier - 1989
5   ConAEuence properties of weak and strong calculi of explicit.. (context) - Curien, Hardin et al. - 1992
5   Normalizing narrowing for weakly terminating and conAEuent s.. (context) - Werner - 1994
4   A unication algorithm for typed lambda calculus (context) - Huet - 1975
3   tude pour les substitutions explicites (context) - Curien, Rios et al. - 1991
2   Higher-order unication via combinators (context) - Dougherty - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.loria.fr.html):   More
Towards a General Signal Interpretation System -.. - Gong, Haton   (Correct)
Description of Specification Developments - Souquières, al.   (Correct)
Termination Proofs using gpo Ordering Constraints - Genet, Gnaedig (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC