Cited in
(79)- scientific article; zbMATH DE number 1497840 (Why is no real title available?)
- scientific article; zbMATH DE number 1497841 (Why is no real title available?)
- RASP and ASP as a fragment of linear logic
- Resourceful program synthesis from graded linear types
- Subexponentials in non-commutative linear logic
- Term sequent logic
- Abductive Logic Grammars
- Formalization of metatheory of the Quipper quantum programming language in a linear logic
- Formalizing operational semantic specifications in logic
- Logical approximation for program analysis
- Efficient resource management for linear logic proof search
- QML
- Focussing and proof construction
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities
- Dynamic spaces in concurrent constraint programming
- Logic programming in a fragment of intuitionistic linear logic
- Proof-search in type-theoretic languages: An introduction
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
- On the algebraic structure of declarative programming languages
- A logical characterization of forward and backward chaining in the inverse method
- MELL in the calculus of structures
- Proof strategies in linear logic
- Resolution calculus for the first order linear logic
- Non-commutative proof construction: a constraint-based approach
- A type system for lock-free processes
- HYBRID
- lolliCoP
- HiLog
- CCSL
- Hiord
- Lilac
- Pict
- Abella
- Bedwyr
- Tac
- ASP
- linTAP
- llprover
- TABLEAUX
- NRL
- Pesca
- CoALP
- Grail
- Focusing and polarization in linear, intuitionistic, and classical logics
- Lincx
- Elf
- WorkflowFM
- Celf
- mini-ML
- RASP
- SKIL
- CatLog3
- PRIZ
- Proofs as computations in linear logic
- The ILLTP library for intuitionistic linear logic
- From multiple sequent for additive linear logic to decision procedures for free lattices
- Linear concurrent constraint programming: Operational and phase semantics
- Phase semantics and Petri net interpretation for resource-sensitive strong negation
- Encryption as an abstract data-type (extended abstract)
- A linear logical framework
- Semantic data modelling using linear logic
- From cut-free calculi to automated deduction: the case of bounded contraction
- First-order linear logic without modalities is NEXPTIME-hard
- Relating state-based and process-based concurrency through linear logic
- Linearizing intuitionistic implication
- ILLTP
- Sympli
- A new framework for declarative programming
- Multimodal linguistic inference
- Plans, actions and dialogues using linear logic
- Resource-distribution via Boolean constraints (extended abstract)
- Connection-based proof construction in linear logic
- Forum: A multiple-conclusion specification logic
- On the unification of classical, intuitionistic and affine logics
- Reasoning in Abella about structural operational semantics specifications
- Relating state-based and process-based concurrency through linear logic (full-version)
- Linearity and iterator types for Gödel's system \(\mathcal T\)
- Constant-only multiplicative linear logic is NP-complete
- A framework for proof systems
This page was built for software: Lolli
