Logic programming in a fragment of intuitionistic linear logic
From MaRDI portal
Publication:1327384
DOI10.1006/inco.1994.1036zbMath0807.68016OpenAlexW2106458801MaRDI QIDQ1327384
Joshua S. Hodas, Dale A. Miller
Publication date: 18 July 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1036
Theory of programming languages (68N15) Logic programming (68N17) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
Dynamic spaces in concurrent constraint programming, The Logic of Bunched Implications, MELL in the calculus of structures, Proof strategies in linear logic, Semantic data modelling using linear logic, Multimodal linguistic inference, RASP and ASP as a fragment of linear logic, Logical approximation for program analysis, A Survey of the Proof-Theoretic Foundations of Logic Programming, Towards substructural property-based testing, A new framework for declarative programming, A linear logical framework, Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax, Functional-Logic Graph Parser Combinators, A rewriting framework and logic for activities subject to regulations, From multiple sequent for additive linear logic to decision procedures for free lattices, Unnamed Item, Unnamed Item, Linearity and iterator types for Gödel's system \(\mathcal T\), A logical characterization of forward and backward chaining in the inverse method, Focusing in Linear Meta-logic, Forum: A multiple-conclusion specification logic, From cut-free calculi to automated deduction: the case of bounded contraction, An Improved Proof-Theoretic Compilation of Logic Programs, Relating State-Based and Process-Based Concurrency through Linear Logic, Encryption as an abstract data-type, Proofs as computations in linear logic, A framework for proof systems, A type system for lock-free processes, Non-commutative proof construction: a constraint-based approach, The multiplicative-additive Lambek calculus with subexponential and bracket modalities, Relating state-based and process-based concurrency through linear logic (full-version), Reasoning in Abella about Structural Operational Semantics Specifications, Closures and Modules Within Linear Logic Concurrent Constraint Programming, Least and Greatest Fixed Points in Linear Logic, Phase semantics and Petri net interpretation for resource-sensitive strong negation, Abductive Logic Grammars, Term Sequent Logic, Formalizing Operational Semantic Specifications in Logic, Connection-based proof construction in linear logic, Resource-distribution via Boolean constraints, On the unification of classical, intuitionistic and affine logics, Subexponentials in non-commutative linear logic, On the algebraic structure of declarative programming languages, Focusing and polarization in linear, intuitionistic, and classical logics, Efficient resource management for linear logic proof search, Proof-search in type-theoretic languages: An introduction, Focussing and proof construction, Formalization of metatheory of the Quipper quantum programming language in a linear logic, Linear concurrent constraint programming: Operational and phase semantics, Resolution calculus for the first order linear logic, Resourceful program synthesis from graded linear types
Uses Software
