Results 1  10
of
190
Linear Objects: logical processes with builtin inheritance
, 1990
"... We present a new framework for amalgamating two successful programming paradigms: logic programming and objectoriented programming. From the former, we keep the declarative reading of programs. From the latter, we select two crucial notions: (i) the ability for objects to dynamically change their ..."
Abstract

Cited by 206 (6 self)
 Add to MetaCart
of the proof of nonground goals. The theoretical background for Linear Objects is Linear Logic, a logic recently introduced to provide a theoretical basis for the study of concurrency. We also show that Linear Objects can be considered a constructive restriction of full Classical Logic. We illustrate
Expressiveness and Complexity of Concurrent Constraint Programming: a Finite Model Theoretic Approach
, 1998
"... We study the expressiveness and complexity of concurrent constraint programming languages over finite domains. We establish strong connections between these languages and query languages in finite model theory. The bridge to finite model theory yields new (and sometimes quite surprising) results on ..."
Abstract
 Add to MetaCart
We study the expressiveness and complexity of concurrent constraint programming languages over finite domains. We establish strong connections between these languages and query languages in finite model theory. The bridge to finite model theory yields new (and sometimes quite surprising) results
Proof Theoretic Approach To Specification Languages
, 1995
"... PROOF THEORETIC APPROACH TO SPECIFICATION LANGUAGES Jawahar Lal Chirimar Advisor: Dale Miller In this thesis I study FORUM as a specification language. FORUM is a higherorder logic based on the logical connectives of Linear Logic. As an initial example, I demonstrate that FORUM is well suited for s ..."
Abstract
 Add to MetaCart
PROOF THEORETIC APPROACH TO SPECIFICATION LANGUAGES Jawahar Lal Chirimar Advisor: Dale Miller In this thesis I study FORUM as a specification language. FORUM is a higherorder logic based on the logical connectives of Linear Logic. As an initial example, I demonstrate that FORUM is well suited
Efficient Computation of Program Equivalence for Confluent Concurrent Constraint Programming∗
"... Concurrent Constraint Programming (ccp) is a wellestablished declarative framework from concurrency theory. Its foundations and principles e.g., semantics, proof systems, axiomatizations, have been thoroughly studied for over the last two decades. In contrast, the development of algorithms and auto ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Concurrent Constraint Programming (ccp) is a wellestablished declarative framework from concurrency theory. Its foundations and principles e.g., semantics, proof systems, axiomatizations, have been thoroughly studied for over the last two decades. In contrast, the development of algorithms
Positive and Negative Diagnosis for Constraint Logic Programs in terms of proof skeletons
, 1997
"... The paper is motivated by the declarative debugging of constraint logic programs. It deals with the theoretical basis of declarative incorrectness diagnosis. It starts with a reformulation of the program semantics in terms of proof tree skeletons, which is suitable for declarative diagnosis study. T ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
The paper is motivated by the declarative debugging of constraint logic programs. It deals with the theoretical basis of declarative incorrectness diagnosis. It starts with a reformulation of the program semantics in terms of proof tree skeletons, which is suitable for declarative diagnosis study
From tests to proofs
 In Proc. ACAS, LNCS 5505
, 2009
"... Abstract. We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been extensively studied from a theoretical viewpoint as a classical means of program verification, in practice existin ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
Abstract. We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been extensively studied from a theoretical viewpoint as a classical means of program verification, in practice
From proofs to focused proofs : a modular proof of focalization in linear logic
 CSL’07, volume 4646 of LNCS
, 2007
"... dale.miller at inria.fr saurin at lix.polytechnique.fr Abstract. Probably the most significant result concerning cutfree sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a number of proof theoretic applications — e.g. in games semantics, ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
dale.miller at inria.fr saurin at lix.polytechnique.fr Abstract. Probably the most significant result concerning cutfree sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a number of proof theoretic applications — e.g. in games semantics
Proof Theory in Linear Logic: A Specification of Concurrent Objects
"... machine [2],the ßcalculus [13], functional paradigms [50]. The CurryHoward isomorphism, where formulas are interpreted as types, proofs as terms (programs) and cutelimination as conversion (computation), has been extended to this new setting yielding definitions of more complex (and more refined ..."
Abstract
 Add to MetaCart
refined) termcalculi, e.g., [2, 51]. Proof theoretic investigations allowed to study, as in the Classical case, both Intuitionistic and Classical formulations of Linear Logic [68]; results were obtained on cutelimination with different fragments of connectives and on a systematic study
Declarative Debugging in Constraint Logic Programming
 Asian Computing Science Conference
, 1996
"... . This paper is motivated by the declarative insufficiency diagnosis of constraint logic programs, but focuses only on theoretical viewpoints. Many techniques have been developed for logic programming but cannot be merely adapted to constraint logic programming. Constraint logic program semantics is ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
is redefined in terms of proof trees using a cover relation. Proof trees give an intrinsic definition to the answers provided by a program. The cover relation expresses that a constraint is covered by a (possibly infinite) constraint set. Thus we give a theoretical framework where declarative diagnosis method
Results 1  10
of
190