• Aucun résultat trouvé

[PDF] Top 20 Concurrency, references and linear logic

Has 10000 "Concurrency, references and linear logic" found on our website. Below are the top 20 most common "Concurrency, references and linear logic".

Concurrency, references and linear logic

Concurrency, references and linear logic

... 50s and 80s, Curry and Howard made the fundamental observation that there is a deep connection between mathemat- ical proofs and computer programs ...independent and reusable blocks, called ... Voir le document complet

154

An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic

An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic

... mobility and epistemic/social ...existential and universal ...spatial and linear ccp using a proof-theoretical ...conception and technical ...space/belief and develop this ... Voir le document complet

13

Automata and temporal logic over arbitrary linear time

Automata and temporal logic over arbitrary linear time

... the logic and the automata model have been ...general linear time could be useful in different settings, including concurrency, asynchronous communi- cation, and others, where using the ... Voir le document complet

14

An introduction to Differential Linear Logic: proof-nets, models and antiderivatives

An introduction to Differential Linear Logic: proof-nets, models and antiderivatives

... formalism and we summa- rize some results, giving bibliographical ...sets and relations (with the usual cartesian product of sets as tensor product) because it underlies most denotational models of ... Voir le document complet

75

Translating types and effects with state monads and linear logic

Translating types and effects with state monads and linear logic

... π-calculus and differential ...nets and non-determinism the translation presented in this work and combining it with elements of [ 10 ], one gets a translation of a multithreaded version of the ... Voir le document complet

15

Generalized connectives for multiplicative linear logic

Generalized connectives for multiplicative linear logic

... ⊗ and `, suggests future investigations on their geometry of interaction [8], their connection to syntaxes for concurrency such as the π-calculus [14] and their denotational semantics [4] expanding ... Voir le document complet

17

Linear logic as a foundation for service-oriented computing

Linear logic as a foundation for service-oriented computing

... of linear logic and of the notion of resource ...as linear logic already appeared to be fruitful in the field of logic ...to linear logic: see for instance the ... Voir le document complet

19

Cones as a model of intuitionistic linear logic

Cones as a model of intuitionistic linear logic

... forms, and similarly ofb!𝑃. We also conjecture thatb!P𝑋 and P!𝑋 are naturally isomorphic (for PCSs 𝑋 ...general and flexible one, allow- ing to interpret probabilistic higher-order programming lan- ... Voir le document complet

20

Expressiveness via Intensionality and Concurrency

Expressiveness via Intensionality and Concurrency

... π-calculus and CPC, but no doubt this could be formalised under different ...literature and to be similar to valid ...28] and doubtless many more as encoding λ-calculus into process calculi is common ... Voir le document complet

21

Higher-order distributions for differential linear logic.

Higher-order distributions for differential linear logic.

... Differential Linear Logic · Categorical semantics · Topological vec- tor ...programs and on data computed from other data ...to Linear Logic [9] and the understanding of the use ... Voir le document complet

21

Deep inference and expansion trees for second-order multiplicative linear logic

Deep inference and expansion trees for second-order multiplicative linear logic

... could imagine an isomorphism 0 ∼ = ∀a.a in a version of our proof nets which is extended with additives and exponentials. However, in this case 0 would not be initial. 9. Conclusions In this paper we have ... Voir le document complet

31

Polynomial time in untyped elementary linear logic

Polynomial time in untyped elementary linear logic

... additives and general weakening generate difficulties in proof nets, we prefer to focus on the simplest pos- sible computational model: multiplicative exponential linear ...additives and useful in ... Voir le document complet

41

Linear temporal logic for regular cost functions

Linear temporal logic for regular cost functions

... equivalence, and decidability ...of Linear Temporal Logic (LTL) over finite words to describe cost ...new logic to ...this logic, using a new syntactic congruence for cost functions ... Voir le document complet

11

Information Hiding, Inheritance and Concurrency

Information Hiding, Inheritance and Concurrency

... Unité de recherche INRIA Rocquencourt Domaine de Voluceau - Rocquencourt - BP 105 - 78153 Le Chesnay Cedex France Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois -[r] ... Voir le document complet

78

Algorithms incorporating concurrency and caching

Algorithms incorporating concurrency and caching

... Elements can live in only five possible places: the input buffer, the middle buffer, the output buffer, the upper-level subboxes' output buffers, and the lower-level subboxes' [r] ... Voir le document complet

213

A Call-By-Push-Value FPC and its interpretation in Linear Logic

A Call-By-Push-Value FPC and its interpretation in Linear Logic

... tial Linear Logic) provides a common setting where both CBN and CBV can be faithfully ...metries and its high degree of asynchrony, the syntax of MELL proof nets is complex and does not ... Voir le document complet

15

The inverse Taylor expansion problem in linear logic

The inverse Taylor expansion problem in linear logic

... the multiplicity of the bit a in ~a (see [2]). This work has been supported by the french ANR CHOCO Interpreting formulæ of LL as vector spaces is not straightforward, because exponentials generate infinite di- mensional ... Voir le document complet

11

Asynchonous Distributed Components: Concurrency and Determinacy

Asynchonous Distributed Components: Concurrency and Determinacy

... 1 Introduction The advent of components in programming technology raises the question of their formal ground, intrinsic semantics, and above all their compositional se- mantics. It represents a real challenge as ... Voir le document complet

20

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

... Our typed structures can be seen as very special cases of partial algebras [6], where the domain of partial operations is defined by typing judgements. Sev- eral encodings from partial algebras to total ones were ... Voir le document complet

17

Proof Nets for First-Order Additive Linear Logic

Proof Nets for First-Order Additive Linear Logic

... preserves and reflects ...if and only if R is. Let L = λ Σ ▷ A, B and R = κ Θ ▷ A, ...coverage and local eigenvariables are immediately preserved and ...side and right-hand side ... Voir le document complet

23

Show all 10000 documents...