Higher-order pattern complement and the strict λ-calculus

Authors:
Alberto Momigliano;Frank Pfenning
Affiliations:
University of Edinburgh, Edinburgh, Scotland, UK;Carnegie Mellon University, Pittsburgh, PA
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2003

Citing 14
Cited 2

Explicit representation of terms defined by counter examples

Journal of Automated Reasoning
Unification revisited

Foundations of deductive databases and logic programming
A transformational approach to negation in logic programming

Journal of Logic Programming
Strictness analysis: a new perspective based on type inference

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Logic programming in the LF logical framework

Logical frameworks
Strictness analysis in logical form

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Positive and negative results for higher-order disunification

Journal of Symbolic Computation
Primitive recursion for higher-order abstract syntax

Theoretical Computer Science
Orthogonal Higher-Order Rewrite Systems are Confluent

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Higher-Order Narrowing with Definitional Trees

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The Theory and Practice of Transforming Call-by-need into Call-by-value

Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Automated Theorem Proving in a Simple Meta-Logic for LF

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

Nominal rewriting with name generation: abstraction vs. locality

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Mechanized metatheory model-checking

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

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 λ-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.