Sep 24, 2001 · We show that, in this more expressive calculus, finite sets of patterns without repeated variables are closed under complement and intersection.

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, ...

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, ...

We address the problem of complementing higher-order linear patterns, i.e. without repetitions of free variables. Differently from the first-order case, ...

Abstract. We address the problem of complementing higher-order lin- ear patterns, i.e. without repetitions of free variables. Di erently from.

The simply-typed λ-calculus is generalized to include an internal notion of strict function so that it can directly express that a term must depend on a ...

this paper we are concerned with the problem of pattern complement in a setting where patterns may contain binding operators, so-called higher-order ...

Bibliographic details on Higher-Order Pattern Complement and the Strict Lambda-Calculus.

Alberto Momigliano , Frank Pfenning: Higher-order pattern complement and the strict lambda-calculus. ACM Trans. Comput. Log. 4(4): 493-529 (2003).

Higher-Order Pattern Complement and the Strict lambda-Calculus. this paper we are concerned with the problem of pattern complement in a setting where patterns ...