Higher-Order Pattern Complement and the Strict Lambda-Calculus

Details Higher-Order Pattern Complement and the Strict Lambda-Calculus Higher-Order Pattern Complement and the Strict Lambda-Calculus

2001-09-24

arxiv.org/abs/cs/0109072v1

ACM Trans. Comput. Log. 4(4): 493-529 (2003)

Computer Science

Logic in Computer Science

37 pages

Scientific paper

10.1145/937555.937559

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.

Affiliated with

Also associated with

No associations

Rating

Higher-Order Pattern Complement and the Strict Lambda-Calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Higher-Order Pattern Complement and the Strict Lambda-Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Higher-Order Pattern Complement and the Strict Lambda-Calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307972