A Uniform Proof-theoretic Investigation of Linear Logic Programming
From MaRDI portal
Recommendations
Cited in
(19)- On the algebraic structure of declarative programming languages
- A new framework for declarative programming
- On the intuitionistic force of classical search
- Efficient resource management for linear logic proof search
- Proof-search in type-theoretic languages: An introduction
- Formalization of linear space theory in the higher-order logic proving system
- The Logic of Bunched Implications
- An effective fixpoint semantics for linear logic programs
- scientific article; zbMATH DE number 1761892 (Why is no real title available?)
- RASP and ASP as a fragment of linear logic
- On the intuitionistic force of classical search (extended abstract)
- scientific article; zbMATH DE number 7455712 (Why is no real title available?)
- scientific article; zbMATH DE number 7199586 (Why is no real title available?)
- Resource-distribution via Boolean constraints (extended abstract)
- Preface to the special volume
- scientific article; zbMATH DE number 5241986 (Why is no real title available?)
- Proofs as computations in linear logic
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
This page was built for publication: A Uniform Proof-theoretic Investigation of Linear Logic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291039)