|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'502'364
Articles rated: 2609
23 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Higher-Order Pattern Complement and the Strict Lambda-Calculus | | Alberto Momigliano
; Frank Pfenning
; | | Date: |
24 Sep 2001 | | Subject: | Logic in Computer Science; Programming Languages ACM-class: D.3.3;D.1.6;F.4.1 | cs.LO cs.PL | | Abstract: | We address the problem of complementing higher-order patterns without repetitions of existential 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 lambda-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 patterns without repeated variables are closed under complement and intersection. Our principal application is the transformational approach to negation in higher-order logic programs. | | Source: | arXiv, cs.LO/0109072 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER