Frank Pfenning School of Computer Science Carnegie Mellon University...  Home/Search
Context Related
Links: DBLP | cmu.edu/~fp/papers/lics91.ps cmu.edu/afs/cs/user/fp/p...lics91.ps.gz cmu.edu/user/fp/www/pape...lics91.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~fp/publications (more) From: cmu.edu/afs/cs/user/fp/public/... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variables (the variables subject to instantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed -calculus by Miller. Most general unifiers and least common antiinstances are shown to exist and are unique up to a simple equivalence. The unification algorithm is used for logic program execution and type and term reconstruction in the current... (Update)
Cited by: More
Intersection Types for a Logical Framework - Frank Pfenning School (Correct)
A Linear Spine Calculus - Cervesato, Pfenning (2001) (Correct)
Linear Higher-Order Pre-Unification - Iliano Cervesato And (1997) (Correct)
Active bibliography (related documents): More All
2.1: Unification and Anti-Unification in the Calculus of Constructions - Pfenning (1991) (Correct)
0.4: Logic Programming in the LF Logical Framework - Pfenning (1991) (Correct)
0.4: Substitutions As Logic Programming Specifications - Liang (Correct)
Similar documents based on text:
91.0: Unknown - (Correct)
Related documents from co-citation: More All
37: A logic programming language with lambda-abstraction - Miller - 1991
29: A framework for defining logics - Harper, Honsell et al. - 1987
28: Logic programming in the LF logical framework - Pfenning - 1991
BibTeX entry: (Update)
F. Pfenning. Unification and anti-unification in the calculus of constructions. In Symp. Logic in Computer Science, pages 74--85, 1991. http://citeseer.ist.psu.edu/pfenning91unification.html More
@inproceedings{ pfenning91unification,
author = "Frank Pfenning",
title = "Unification and Anti-Unification in the {Calculus} of {Constructions}",
booktitle = "Sixth Annual {IEEE} Symposium on Logic in Computer Science",
address = "Amsterdam, The Netherlands",
pages = "74--85",
year = "1991",
url = "citeseer.ist.psu.edu/pfenning91unification.html" }
Citations (may not include all citations):267 A note on inductive generalization (context) - Plotkin - 1970
266 Information and Computation (context) - Coquand, Huet et al. - 1988 DBLP
251 A logic programming language with lambda-abstraction - Miller - 1989
210 Logic programming in the LF logical framework - Pfenning - 1991 ACM
174 A unification algorithm for typed -calculus (context) - Huet - 1975
166 An overview of Prolog (context) - Nadathur, Miller - 1988
166 Unification revisited (context) - Lassez, Maher et al. - 1988 ACM DBLP
126 Higher-order critical pairs (context) - Nipkow - 1991 DBLP
97 The undecidability of the second-order unification problem (context) - Goldfarb - 1981 DBLP
96 An algorithm for testing conversion in type theory (context) - Coquand - 1991 ACM
71 Elf: A language for logic definition and verified meta-progr.. - Pfenning - 1989
63 Transformational systems and the algebraic structure of atom.. (context) - Reynolds - 1970
30 The TPS theorem proving system (context) - Andrews, Issar et al. - 1990 ACM DBLP
25 Isabelle tutorial and user's manual - Paulson, Nipkow - 1990
24 equations dans des langages d'ordre (context) - Huet - 1976
16 The Church-Rosser theorem for LF with fij-reduction (context) - Salvesen - 1990
12 programs from proofs in the calculus of constructions (context) - Paulin-Mohring - 1989
11 Higher-order and modal logic as a framework for explanationb.. (context) - Dietzen, Pfenning - 1991
7 also published as ECS-LFCS (context) - Pym, Search et al. - 1990
6 A preliminary version appeared in Symposium on Logic in Comp.. (context) - Harper, Honsell et al. - 1987
5 A proof synthesis algorithm for a mathematical vernacular in.. (context) - Dowek - 1991
4 and typical ambiguity in the Calculus of Constructions (context) - Harper, Pollack et al. - 1989
3 Extensions and Applications of Higher-Order Unification (context) - Elliott - 1990 ACM
2 Caliban: A Programming Language and Environment Based on Typ.. (context) - Duggan - 1991
2 Generalization from partial parameterization in higher-order.. (context) - Hagiya - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (Correct)
Compiler Verification in LF - Hannan, Pfenning (1992) (Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002) (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