• Aucun résultat trouvé

[PDF] Top 20 Object calculi in linear logic

Has 10000 "Object calculi in linear logic" found on our website. Below are the top 20 most common "Object calculi in linear logic".

Object calculi in linear logic

Object calculi in linear logic

... arising in the proof, ...used in the completeness proof for the language of higher-order hereditary Harrop formulas (hohh) of ...As in that case, there are two cases to consider, depending on whether ... Voir le document complet

35

Effects in Call-By-Push-Value, from a Linear Logic point of view

Effects in Call-By-Push-Value, from a Linear Logic point of view

... these calculi in Linear Logic ...used. In CBN, an application (s)t is defined as the linear application of s to the promotion of t and the abstraction λx s is simply interpreted ... Voir le document complet

18

Linear logic as a foundation for service-oriented computing

Linear logic as a foundation for service-oriented computing

... Various calculi [4,12,17] have been proposed with the aim to capture aspects of service- oriented computing, from a verification or a modeling point of view but also from a formaliza- tion and programming point of ... Voir le document complet

19

Introduction to linear logic and ludics, part II

Introduction to linear logic and ludics, part II

... ago in the study of models of untyped λ-calculi [15, 44], and have been used to give semantic foundations to object-oriented programming (see, ...point in the plane, while giving an r and a ... Voir le document complet

50

Par Means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs

Par Means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs

... process calculi have been already investigated (see [16]). Unfortunately, linear logic has not so far provided via Curry-Howard a logical account of asyn- chronous ...cut-elimination in ... Voir le document complet

37

Interaction Graphs: Full Linear Logic

Interaction Graphs: Full Linear Logic

... origins in Girard’s work on functors’s models for lambda-calculus ...on linear logic [15] and actually inspired it, exhibits for the first time a decomposition of the semantic interpretation of ... Voir le document complet

16

Concurrency, references and linear logic

Concurrency, references and linear logic

... backend. In this regard, one may consider LL and derived systems as “functional assembly ...of calculi to LL have already been ...done in parallel without breaking the original operational ... Voir le document complet

154

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 ...interpreted. In spite of its appealing sym- metries and its high degree of asynchrony, the syntax of MELL ... Voir le document complet

15

Infinitary Lambda Calculi from a Linear Perspective

Infinitary Lambda Calculi from a Linear Perspective

... `Λ in a very simple way following the so-called Girard’s translation [13]: abstractions become nonlinear abstractions, and any application M N is translated into M !N .... In other words, all arguments can ... Voir le document complet

25

Internal Calculi for Separation Logic

Internal Calculi for Separation Logic

... favourite logic is usually quite ...the logic at ...the linear-time µ-calculus [28, 19], the modal µ-calculus [39] or for the alternating-time temporal logic ATL ...Hoare-Floyd logic to ... Voir le document complet

19

Logic and Linear programs to understand cancer response

Logic and Linear programs to understand cancer response

... genes in the intersection of both ...participating in the DREAM challenge using gene expression profiles provided by different research institutes, other than HOVON and ...challenge in particular the ... Voir le document complet

21

Automata and temporal logic over arbitrary linear time

Automata and temporal logic over arbitrary linear time

... ordinals. In this paper, we focus on the general case of arbitrary linear orderings, using the full logic with Until, Since and both Stavi ...automata in this setting. Automata on ... Voir le document complet

14

From Linear Temporal Logic Properties to Rewrite Propositions

From Linear Temporal Logic Properties to Rewrite Propositions

... Abstract. In the regular model-checking framework, reachability analysis can be guided by temporal logic properties, for instance to achieve the counter example guided abstraction refinement (CEGAR) ... Voir le document complet

35

Introduction to linear logic and ludics, part I

Introduction to linear logic and ludics, part I

... Introduction Linear logic arose from the semantic study of λ-calculus, specifically, the second-order typed λ-calculus, or system F (see ...that in coherence spaces (to be introduced in ... Voir le document complet

30

Natural deduction calculi and sequent calculi for counterfactual logics

Natural deduction calculi and sequent calculi for counterfactual logics

... sequent calculi for the systems CK + {ID, MP}, that serve as a base to develop related labelled natural deduction calculi for the same ...deduction calculi fill (at least partially) the gap in ... Voir le document complet

34

Proof Nets for Intuitionistic Linear Logic: Essential Nets

Proof Nets for Intuitionistic Linear Logic: Essential Nets

... results in general, but can always be carried ...pair in the given path. Notice that in the diagram above a trail that ends in z or ¡ is ... Voir le document complet

33

Proof Nets for First-Order Additive Linear Logic

Proof Nets for First-Order Additive Linear Logic

... additive linear logic, the fragment of linear logic with sum, product, and first-order universal and existential ...nets in addition factor out any inessential choice for existential ... Voir le document complet

23

Semantics of linear logic and higher-order model-checking

Semantics of linear logic and higher-order model-checking

... second-order logic (MSO) is a logic of choice, as its model-checking is decidable over the complete binary tree [Rab69] but also on infinite graphs generated by pushdown structures ...given in 2001 ... Voir le document complet

300

Combining Linear Logic and Size Types for Implicit Complexity

Combining Linear Logic and Size Types for Implicit Complexity

... incident, in the sense that on both sides some attempts have been made to repair these defects but only with modest success: in [7] for instance LLL is extended to a language with recursive definitions, but ... Voir le document complet

37

Linear Temporal Logic and Propositional Schemata, Back and Forth

Linear Temporal Logic and Propositional Schemata, Back and Forth

... decidable in [2, ...numbers in indices. Since implementations for this logic do not have the same support as standard LTL and are generally not as efficient, such a reduction could help in ... Voir le document complet

9

Show all 10000 documents...