Lolli

swMATH40831MaRDI QIDQ5975143FDOQ5975143

Author name not available (Why is that?)

Official website: http://www.lix.polytechnique.fr/~dale/lolli/

Cited In (77)

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

This page was built for software: Lolli