Results 1 
3 of
3
Towards the Automation of the Design of Logic Programming Languages
 Department of Computer Science, RMIT
, 1997
"... Logic programs consist of formulas of mathematical logic and various prooftheoretic techniques can be used to design and analyse execution models for such programs. We briefly review the main problems, which are questions that are still elusive in the design of logic programming languages, from a p ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Logic programs consist of formulas of mathematical logic and various prooftheoretic techniques can be used to design and analyse execution models for such programs. We briefly review the main problems, which are questions that are still elusive in the design of logic programming languages, from a prooftheoretic point of view. Existing approaches and analyses which lead to the various languages are all rather sophisticated and involve complex manipulations of proofs. All are designed for analysis on paper by a human and many of them are ripe for automation. We aim to perform the automation of some aspects of prooftheoretic analyses, in order to assist in the design of logic programming languages. In this paper we describe the first steps towards the design of such an automatic analysis tool. We investigate the usage of particular proof manipulations for the analysis of logic programming strategies. We propose a more precise specification of sequent calculi inference rules that we use ...
Proofs, concurrent objects and computations in a FILL framework
 IN WORKSHOP ON OBJECTBASED PARALLEL AND DISTRIBUTED COMPUTATION, OBPDC'95
, 1995
"... There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, objectoriented or concurrent ones in a same logical language. Linear logic seems to be wellsuited to describe computations that are c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, objectoriented or concurrent ones in a same logical language. Linear logic seems to be wellsuited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyze a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for nondeterminisms management, as foundation of concurrent objectoriented programming, following the two paradigms proofsearch as computation and proofs as computations.
Proof Manipulations for Logic Programming Proof Systems
, 2001
"... Logic programs consist of formulas of mathematical logic and various prooftheoretic techniques can be used to design and analyse execution models for such programs. In this paper we present some initial work on the problem of making systematic the design of logic programming languages. In particula ..."
Abstract
 Add to MetaCart
(Show Context)
Logic programs consist of formulas of mathematical logic and various prooftheoretic techniques can be used to design and analyse execution models for such programs. In this paper we present some initial work on the problem of making systematic the design of logic programming languages. In particular, we identify and discuss several key properties of proofs. A important aspect of this examination is a a more precise specification of sequent calculi inference rules in order to study permutation properties, which are key aspect of the design of logic programming systems. We also show how this specification can be used to manipulate proofs, as well as to establish properties of sets of inference rules. In addition we describe how Boolean expressions can be used to detect unused formulae in a proof, which is important for debugging purposes. Keywords: sequent calculi, logic programming, search strategies, substructural logic. 1