Abstract. Logic programming can be given a foundation in sequent calculus, viewing computation as the process of building a cut-free sequent proof from the bottom-up. Earliest accounts of logic programming were based in classical logic and then later in intuitionistic logic. The use of linear logic to design new logic programming languages was inevitable given that it allows for more dynamics in the way sequents change during the search for a proof and since it can account for logic programming in these other logics. We overview how linear logic has been used to design new logic programming languages and describe some applications and implementation issues for such languages. §1. Introduction. It is now common place to recognize the importa...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
Linear logic was introduced by Girard in 1987 [11]. Since then many results have supported Girard&ap...
For many given systems of logic, it is possible to identify, via systematic proof-theoretic analyses...
This paper is an overview of existing applications of Linear Logic (LL) to issues of computation. Af...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
Girard’s claims such as “Linear logic is a resource conscious logic”. Increasingly, computer scienti...
15 pagesThe so famous Prolog paradigm is based on the refutation of a goal, i.e. inferring the empty...
The purpose of this paper is to give an exposition of material dealing with constructive logic, type...
This book illustrates linear logic in the application of proof theory to computer science
lambda-Calculi The purpose of this paper is to give an exposition of material dealing with construct...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
The idea of introducing logical variables into functional programming languages has been proposed fo...
International audienceThe earliest and most popular use of logic in computer science views computati...
We describe and discuss the implementation of a new logic programming language called Lygon. This l...
In this paper, we propose a new static analysis method which is applicable for a classical linear lo...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
Linear logic was introduced by Girard in 1987 [11]. Since then many results have supported Girard&ap...
For many given systems of logic, it is possible to identify, via systematic proof-theoretic analyses...
This paper is an overview of existing applications of Linear Logic (LL) to issues of computation. Af...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
Girard’s claims such as “Linear logic is a resource conscious logic”. Increasingly, computer scienti...
15 pagesThe so famous Prolog paradigm is based on the refutation of a goal, i.e. inferring the empty...
The purpose of this paper is to give an exposition of material dealing with constructive logic, type...
This book illustrates linear logic in the application of proof theory to computer science
lambda-Calculi The purpose of this paper is to give an exposition of material dealing with construct...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
The idea of introducing logical variables into functional programming languages has been proposed fo...
International audienceThe earliest and most popular use of logic in computer science views computati...
We describe and discuss the implementation of a new logic programming language called Lygon. This l...
In this paper, we propose a new static analysis method which is applicable for a classical linear lo...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
Linear logic was introduced by Girard in 1987 [11]. Since then many results have supported Girard&ap...
For many given systems of logic, it is possible to identify, via systematic proof-theoretic analyses...