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