See this document in CiteSeerX!

Unification in a lambda-Calculus with Intersection Types  (Make Corrections)  
Michael Kohlhase, Frank Pfenning
International Logic Programming Symposium



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
cmu.edu/~fp/papers/ilps93.ps.gz
cmu.edu/afs/cs/user/fp/p...ilps93.ps.gz
cmu.edu/user/fp/www/pape...ilps93.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/afs/cs/user/fp/...lfsbib (more)
From:  cmu.edu/afs/cs/user/fp/public/...
(Enter author homepages)

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

Abstract: We propose related algorithms for unification and constraint simplification in !& , a refinement of the simply-typed -calculus with subtypes and bounded intersection types. !& is intended as the basis of a logical framework in order to achieve more succinct and declarative axiomatizations of deductive systems than possible with the simply-typed -calculus. The unification and constraint simplification algorithms described here lay the groundwork for a mechanization of such frameworks as... (Update)

Similar documents (at the sentence level):
44.6%:   Unification in a lambda-Calculus with Intersection Types - Kohlhase, Pfenning   (Correct)

Active bibliography (related documents):   More   All
0.5:   Intersection Types for a Logical Framework - Frank Pfenning (1992)   (Correct)
0.3:   Omega-MKRP - A Proof Development Environment - Huang, Kerber, Kohlhase.. (1992)   (Correct)
0.3:   Refinement Types for Logical Frameworks - Frank Pfenning (1993)   (Correct)

Similar documents based on text:   More   All
0.2:   Type Assignment for Intersections and Unions in.. - Dunfield, Pfenning (2003)   (Correct)
0.2:   Agent-Oriented Integration of Distributed Mathematical Services - Franke, Hess, al. (1999)   (Correct)
0.2:   Reduction and Unification in Lambda Calculi with a General.. - Qian, Nipkow (1994)   (Correct)

BibTeX entry:   (Update)

@inproceedings{ kohlhase93unification,
    author = "Michael Kohlhase and Frank Pfenning",
    title = "Unification in a Lambda-Calculus with Intersection Types",
    booktitle = "International Logic Programming Symposium",
    pages = "488-505",
    year = "1993",
    url = "citeseer.ist.psu.edu/17802.html" }
Citations (may not include all citations):
434   A framework for defining logics - Harper, Honsell et al. - 1993  ACM   DBLP
340   Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991  ACM   DBLP
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
81   Refinement types for ML - Freeman, Pfenning - 1991  ACM   DBLP
68   Unification under a mixed prefix (context) - Miller - 1992
67   Programming with Intersection Types and Bounded Polymorphism - Pierce - 1991  ACM
61   Logic Programming over Polymorphically Order-Sorted Types - Smolka - 1989
54   Specifying and Implementing Theorem Provers in a HigherOrder.. (context) - Felty - 1989
49   Computational Aspects of an Order-Sorted Logic with Term Dec.. (context) - Schmidt-Schauss - 1989  ACM
46   Types in Logic Programming (context) - Pfenning - 1992  ACM   DBLP
39   A complete type inference algorithm for simple intersection .. (context) - Coppo, Giannini - 1992  ACM   DBLP
27   The coherence of languages with intersection types (context) - Reynolds - 1991  ACM   DBLP
25   Isabelle tutorial and user's manual - Paulson, Nipkow - 1990
25   Investigating a Proof-Theoretic Meta-Language for Functional.. (context) - Hannan - 1991
23   The new implementation of ALF (context) - Magnusson - 1992
14   Reduction and unification in lambda calculi with subtypes (context) - Nipkow, Qian - 1992
11   Progress in Computer Science and Applied Logic (context) - Snyder, Theory et al. - 1991
10   Unification in order-sorted type theory (context) - Kohlhase - 1992
7   Intersection types for a logical framework - Pfenning - 1992
4   Order-sorted type theory I: Unification (context) - Kohlhase - 1991
1   Combining prescriptive and taxonomic types in logic programm.. (context) - Hill - 1993

Documents on the same site (http://www.cs.cmu.edu/afs/cs/user/fp/www/lfs-bib.html):   More
The Occurrence of Continuation Parameters in CPS Terms - Danvy, Pfenning (1995)   (Correct)
A Proof of the Church-Rosser Theorem and its Representation in a .. - Pfenning (1992)   (Correct)
Structural Cut Elimination in Linear Logic - Pfenning (1994)   (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