scientific article
From MaRDI portal
Publication:3357521
zbMath0731.68022MaRDI QIDQ3357521
Jean-Marc Andreoli, Remo Pareschi
Publication date: 1991
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic programming (68N17)
Related Items
Distributed programming with logic tuple spaces, True concurrency semantics for a linear logic programming language with broadcast communication, Structure of proofs and the complexity of cut elimination, First-order linear logic without modalities is NEXPTIME-hard, Semantic data modelling using linear logic, Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols, Refining multiset transformers, A Survey of the Proof-Theoretic Foundations of Logic Programming, Non-commutative logic. III: Focusing proofs., Forum: A multiple-conclusion specification logic, On the unity of logic, Relating State-Based and Process-Based Concurrency through Linear Logic, Blackboard relations in the \(\mu\text{Log}\) coordination model, On the Relations between Disjunctive and Linear Logic Programming, Linearizing intuitionistic implication, Proofs as computations in linear logic, Polarized and focalized linear and classical proofs, Coordination: Reo, Nets, and Logic, A declarative framework for object-oriented programming with genetic inheritance, Relating state-based and process-based concurrency through linear logic (full-version), Closures and Modules Within Linear Logic Concurrent Constraint Programming, Least and Greatest Fixed Points in Linear Logic, Focusing and polarization in linear, intuitionistic, and classical logics, LMNtal as a hierarchical logic programming language, Efficient resource management for linear logic proof search, Proof-search in type-theoretic languages: An introduction, Linear concurrent constraint programming: Operational and phase semantics, The additive multiboxes, Interactive observability in Ludics: the geometry of tests
