Disjunctive Constraint Lambda Calculi
نویسندگان
چکیده
Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no more than one solution to a set of constraints. We now introduce two forms of Constraint Lambda Calculi which allow for multiple constraint solutions. Moreover the language also permits the use of disjunctions between constraints rather than just conjunction. These calculi are the Unrestricted, and the Restricted, Disjunctive Constraint-Lambda Calculi. We establish a limited form of confluence for the unrestricted calculus and a stronger form for the restricted one. We also discuss the denotational semantics of our calculi and some implementation issues.
منابع مشابه
Disjunctive Axioms and Concurrent $\lambda$-Calculi: a Curry-Howard Approach
We add to intuitionistic logic infinitely many classical disjunctive tautologies and use the Curry–Howard correspondence to obtain typed concurrent λ-calculi; each of them features a specific communication mechanism, including broadcasting and cyclic messageexchange, and enhanced expressive power w.r.t. the λ-calculus. Moreover they all implement forms of code mobility. Our results provide a fi...
متن کاملSimultaneous Search in Connection Tableau Calculi by Means of Disjunctive Constraints
Automated theorem proving with connection tableau calculi imposes search problems in tremendous search spaces. In this paper, we present a new approach to search space reduction in connection tableau calculi. In our approach structurally similar parts of the search space are compressed by means of disjunctive constraints. We describe the necessary changes of the calculus, and we develop elabora...
متن کاملFilter Models for Conjunctive-Disjunctive -calculi?
The distinction between the conjunctive nature of non-determinism as opposed to the disjunctive character of parallelism constitutes the motivation and the starting point of the present work. -calculus is extended with both a non-deterministic choice and a parallel operator; a notion of reduction is introduced, extending -reduction of the classical calculus. We study type assignment systems for...
متن کاملAn Efficient Algorithm for Generating Composition Tables for Qualitative Spatial Relations
Qualitative Spatial Reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not pertinent or not available. The automated derivation of such logical inferences becomes a binary constraint satisfaction problem; binary relations can be formulated as a region-based qualitative reasoning problem involving disjunctive constraints. It has been proved [1] tha...
متن کاملDisjunctive bases: normal forms and model theory for modal logics
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it m...
متن کامل