Alberto Momigliano, Frank Pfenning  Home/Search
Context Related
| cmu.edu/afs/cs/user/mobile/...iclp99.ps cmu.edu/user/fp/www/pape...iclp99.ps.gz cmu.edu/People/fp/papers...iclp99.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/~twelf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a finite set of patterns. We therefore generalize the simply-typed -calculus to include an internal notion of strict function so that we can directly express that a term must depend on a given variable. We show that, in this more expressive calculus, finite sets of... (Update)
Context of citations to this paper: More
...with negation, and the Open World Assumption (OWA) typical of languages with embedded implication. The rst problem has been solved in [14], by introducing a strict calculus where term complement in the simply typed calculus can be embedded and performed. 412 Alberto...
.... (E 1 x) E 2 x) strict( x : E 2 x) non linx( x : E 2 x) non linxapp 4 : non linx( x : app (E 1 x) E 2 x) non linx( x : E 1 x) non linx( x : E 2 x) We remark that the occurrence constraints can be internalized in a strict type theory as described in [3]. More details and...
Cited by: More
Elimination of Negation in a Logical Framework - Momigliano (Correct)
A Step-to-Step Example of Negation Elimination in Hereditary.. - Momigliano (Correct)
Similar documents (at the sentence level): More
74.3%: The Relative Complement Problem for Higher-Order Patterns - Momigliano, Pfenning (1999) (Correct)
42.3%: Higher-Order Pattern Complement and Strict Lambda-Calculus - Alberto Momigliano.. (1999) (Correct)
17.5%: Higher-Order Pattern Complement and the Strict ...-Calculus - Momigliano, Pfenning (Correct)
Active bibliography (related documents): More All
0.1: Automated Theorem Proving in a Simple Meta Logic for LF - Schürmann, Pfenning (1998) (Correct)
0.1: The Fox Project: Advanced Language Technology for.. - Harper, Lee, Pfenning (1998) (Correct)
0.1: System Description: Twelf - A Meta-Logical Framework for.. - Pfenning, Schürmann (1999) (Correct)
Similar documents based on text: More All
0.3: Optimizing Higher-Order Pattern Unification - Pientka, Pfenning (2003) (Correct)
0.1: Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994) (Correct)
0.1: Linear Higher-Order Pre-Unification - Iliano Cervesato, Frank Pfenning (1997) (Correct)
Related documents from co-citation: More All
4: Elimination of negation in a logical framework - Momigliano
2: A logic for reasoning with higher-order abstract syntax (context) - McDowell, Miller - 1997
2: On Hereditary Harrop Formulae as a Basis for Logic Programming (context) - Harland - 1991
BibTeX entry: (Update)
A. Momigliano and F. Pfenning. The relative complement problem for higher-order patterns. In D. D. Schreye, editor, Proceedings of the 1999 International Conference on Logic Programming (ICLP'99), pages 389-395, La Cruces, New Mexico, 1999. MIT Press. http://citeseer.ist.psu.edu/article/momigliano99relative.html More
@inproceedings{ momigliano99relative,
author = "Alberto Momigliano and Frank Pfenning",
title = "The Relative Complement Problem for Higher-Order Patterns",
booktitle = "International Conference on Logic Programming",
pages = "380-394",
year = "1999",
url = "citeseer.ist.psu.edu/article/momigliano99relative.html" }
Citations (may not include all citations):251 A logic programming language with lambda-abstraction - Miller - 1991
210 Logic programming in the LF logical framework - Pfenning - 1991
126 Higher-order critical pairs (context) - Nipkow - 1991
90 A linear logical framework - Cervesato, Pfenning - 1996
56 Unification and anti-unification in the Calculus of Construc.. - Pfenning - 1991
48 Disunification: A survey - Comon - 1991
47 Natural semantics and some of its meta-theory in Elf - Michaylov, Pfenning - 1991
44 Higher-order narrowing with definitional trees - Hanus, Prehofer - 1996
31 Answer sets and negation-as-failure (context) - Kunen - 1987
30 A transformational approach to negation in logic programming (context) - Barbuti, Mancarella et al. - 1990
25 Explicit representation of terms defined by counter examples (context) - Lassez, Marriot - 1987
13 Reduction types and intensionality in the lambda-calculus (context) - Wright - 1992
12 Elimination of negation in a logical framework - Momigliano
10 Compilative constructive negation in constraint logic progra.. - Bruscoli, Levi et al. - 1994
8 Positive and negative results for higher-order disunificatio.. - Lugiez - 1995
7 Automated theorem proving in a simple metalogic for LF (context) - Schurmann, Pfenning - 1998
Documents on the same site (http://www.cs.cmu.edu/~twelf/): More
System Description: Twelf - A Meta-Logical Framework for.. - Pfenning, Schürmann (1999) (Correct)
System Description: Twelf - A Meta-Logical Framework for.. - Pfenning, Schürmann (1999) (Correct)
Elimination of Negation in a Logical Framework - Momigliano (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