The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic refinement, Lolli [12], provide data types, higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] provides for concurrency but lacks abstraction mechanisms. In this paper we present Forum, a logic programming presentation of all of linear logic that modularly extends the languages Prolog, Lolli, and LO. Forum, therefore, allows specifications to incorporate both abstractions and concurrency. As a meta-language, Forum greatly extends the expressiveness of these other logic programming languages. To ill...
Meta-programming extends logic programming with the possibility of having a program to create or ana...
A logical characterization of the typical features of object-oriented languages could yield a clear ...
Abstract. A meta-level extension of a logic programming language is presented. The resulting languag...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
AbstractThe theory of cut-free sequent proofs has been used to motivate and justify the design of a ...
Abstract. Logic programming can be given a foundation in sequent calculus, viewing computation as th...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
The paper focuses on the use of linear logic as a specification language of the operational semantic...
Rapport interne.In the paper we consider a proof-theoretical approach to Linear Logic in order to de...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
Article dans revue scientifique avec comité de lecture.This paper focuses on the use of linear logic...
It has been argued elsewhere that a logic programming language with function variables and A-abstrac...
15 pagesThe so famous Prolog paradigm is based on the refutation of a goal, i.e. inferring the empty...
AbstractWhen Miller introduced Forum he called it a specification logic, rather than a logic program...
A meta-level extension of a logic programming language is presented. The resulting language, called ...
Meta-programming extends logic programming with the possibility of having a program to create or ana...
A logical characterization of the typical features of object-oriented languages could yield a clear ...
Abstract. A meta-level extension of a logic programming language is presented. The resulting languag...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
AbstractThe theory of cut-free sequent proofs has been used to motivate and justify the design of a ...
Abstract. Logic programming can be given a foundation in sequent calculus, viewing computation as th...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
The paper focuses on the use of linear logic as a specification language of the operational semantic...
Rapport interne.In the paper we consider a proof-theoretical approach to Linear Logic in order to de...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
Article dans revue scientifique avec comité de lecture.This paper focuses on the use of linear logic...
It has been argued elsewhere that a logic programming language with function variables and A-abstrac...
15 pagesThe so famous Prolog paradigm is based on the refutation of a goal, i.e. inferring the empty...
AbstractWhen Miller introduced Forum he called it a specification logic, rather than a logic program...
A meta-level extension of a logic programming language is presented. The resulting language, called ...
Meta-programming extends logic programming with the possibility of having a program to create or ana...
A logical characterization of the typical features of object-oriented languages could yield a clear ...
Abstract. A meta-level extension of a logic programming language is presented. The resulting languag...