AbstractThe design of linear logic programming languages and theorem provers opens a number of new implementation challenges not present in more traditional logic languages such as Horn clauses (Prolog) and hereditary Harrop formulas (λProlog and Elf). Among these, the problem of efficiently managing the linear context when solving a goal is of crucial importance for the use of these systems in non-trivial applications. This paper studies this problem in the case of Lolli [10], though its results have application to other systems including those based on linear type theory. We first give a proof-theoretic presentation of the operational semantics of this language as a resolution calculus. We then present a series of resource management syst...
AbstractThis work presents an extension of the Tag-Frame resource management system previously devel...
Linear logic as introduced by Girard and presented in the previous chapter is a rich system for the ...
In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving...
The design of linear logic programming languages and theorem provers opens a number of new implement...
The design of linear logic programming languages and theorem provers opens a number of new implement...
AbstractThe design of linear logic programming languages and theorem provers opens a number of new i...
Linear logic, introduced by J.-Y.Girard, is a refinement of classical logic providing means for cont...
Recently there has been significant interest in the logic programming community in linear logic, a l...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
AbstractThe notions of uniform proof and of resolution represent the foundations of the proof-theore...
There have been several proposals for logic programming language based on linear logic: Lolli [6], ...
AbstractThe notions of uniform proof and of resolution represent the foundations of the proof-theore...
One central aspect of proof search in linear logic is resource management. Strategies for efficient ...
1 Introduction In linear logic [5, 2], hypotheses are viewed as resources, with the number of oc-cur...
AbstractThis work presents an extension of the Tag-Frame resource management system previously devel...
Linear logic as introduced by Girard and presented in the previous chapter is a rich system for the ...
In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving...
The design of linear logic programming languages and theorem provers opens a number of new implement...
The design of linear logic programming languages and theorem provers opens a number of new implement...
AbstractThe design of linear logic programming languages and theorem provers opens a number of new i...
Linear logic, introduced by J.-Y.Girard, is a refinement of classical logic providing means for cont...
Recently there has been significant interest in the logic programming community in linear logic, a l...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
AbstractThe notions of uniform proof and of resolution represent the foundations of the proof-theore...
There have been several proposals for logic programming language based on linear logic: Lolli [6], ...
AbstractThe notions of uniform proof and of resolution represent the foundations of the proof-theore...
One central aspect of proof search in linear logic is resource management. Strategies for efficient ...
1 Introduction In linear logic [5, 2], hypotheses are viewed as resources, with the number of oc-cur...
AbstractThis work presents an extension of the Tag-Frame resource management system previously devel...
Linear logic as introduced by Girard and presented in the previous chapter is a rich system for the ...
In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving...