AbstractLogical frameworks serve as meta languages to represent deductive systems, sometimes requiring special purpose meta logics to reason about the representations. In this work, we describe Lω+, a meta logic for the linear logical framework LLF [Iliano Cervesato and Frank Pfenning. A linear logical framework. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science, pages 264–275, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.] and illustrate its use via a proof of the admissibility of cut in the sequent calculus for the tensor fragment of linear logic. Lω+ is first-order, intuitionistic, and not linear. The soundness of Lω+ is shown
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
International audienceWhen studying sequent calculi, proof theorists often have to prove properties ...
AbstractLogical frameworks serve as meta languages to represent deductive systems, sometimes requiri...
International audienceAbstract Linear logic (LL) has been used as a foundation (and inspiration) for...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
International audienceAbstract One of the most fundamental properties of a proof system is analytici...
We present a variant of the linear logical framework LLF that avoids the restriction that well-typed...
The LF logical framework codifies a methodology for representing deductive systems, such as programm...
AbstractWe present the linear type theory λΠ⊸&⊤ as the formal basis for LLF, a conservative extensio...
We present the linear type theory λ Π−◦& ⊤ as the formal basis for LLF, a conservative extension...
AbstractThis issue contains the Proceedings of the Third International Workshop on Logical Framework...
We reexamine the foundations of linear logic, developing a system of natural deduction following Mar...
We reexamine the foundations of linear logic, developing a system of natural deduction following Ma...
Girard's recent system of linear logic is presented in a way that avoids the two-level structure of ...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
International audienceWhen studying sequent calculi, proof theorists often have to prove properties ...
AbstractLogical frameworks serve as meta languages to represent deductive systems, sometimes requiri...
International audienceAbstract Linear logic (LL) has been used as a foundation (and inspiration) for...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
International audienceAbstract One of the most fundamental properties of a proof system is analytici...
We present a variant of the linear logical framework LLF that avoids the restriction that well-typed...
The LF logical framework codifies a methodology for representing deductive systems, such as programm...
AbstractWe present the linear type theory λΠ⊸&⊤ as the formal basis for LLF, a conservative extensio...
We present the linear type theory λ Π−◦& ⊤ as the formal basis for LLF, a conservative extension...
AbstractThis issue contains the Proceedings of the Third International Workshop on Logical Framework...
We reexamine the foundations of linear logic, developing a system of natural deduction following Mar...
We reexamine the foundations of linear logic, developing a system of natural deduction following Ma...
Girard's recent system of linear logic is presented in a way that avoids the two-level structure of ...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number o...
International audienceWhen studying sequent calculi, proof theorists often have to prove properties ...