Linearity Constraints as Bounded Intervals in Linear Logic Programming

DOI10.1093/logcom/exi073zbMath1120.03020OpenAlexW2020131921MaRDI QIDQ5488612

Jeff Polakow

Publication date: 22 September 2006

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

Full work available at URL: https://doi.org/10.1093/logcom/exi073

zbMATH Keywords

resource managementproof searchlinear logic programming

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (1)

Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax

Uses Software

• Twelf

This page was built for publication: Linearity Constraints as Bounded Intervals in Linear Logic Programming