A Uniform Proof-theoretic Investigation of Linear Logic Programming

DOI10.1093/logcom/4.2.175zbMath0797.03054OpenAlexW1968027005MaRDI QIDQ4291039

James Harland, David J. Pym

Publication date: 17 October 1994

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/457c4f235e08f27a60c609cab688289e7b592e35

zbMATH Keywords

linear logicgoal-to-subgoal proof search

Mathematics Subject Classification ID

Logic programming (68N17) Proof theory in general (including proof-theoretic semantics) (03F03) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (12)

The Logic of Bunched Implications ⋮ RASP and ASP as a fragment of linear logic ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ A new framework for declarative programming ⋮ On the intuitionistic force of classical search (Extended abstract) ⋮ Preface to the special volume ⋮ Proofs as computations in linear logic ⋮ Resource-distribution via Boolean constraints ⋮ On the algebraic structure of declarative programming languages ⋮ On the intuitionistic force of classical search ⋮ Efficient resource management for linear logic proof search ⋮ Proof-search in type-theoretic languages: An introduction

This page was built for publication: A Uniform Proof-theoretic Investigation of Linear Logic Programming