scholarly journals Preface

2016 ◽  
Vol 28 (7) ◽  
pp. 991-994
Author(s):  
LORENZO TORTORA DE FALCO

This special issue is devoted to some aspects of the new ideas that recently arose from the work of Thomas Ehrhard on the models of linear logic (LL) and of the λ-calculus. In some sense, the very origin of these ideas dates back to the introduction of LL in the 80s by Jean-Yves Girard. An obvious remark is that LL yielded a first logical quantitative account of the use of resources: the logical distinction between linear and non-linear formulas through the introduction of the exponential connectives. As explicitly mentioned by Girard in his first paper on the subject, the quantitative approach, to which he refers as ‘quantitative semantics,’ had a crucial influence on the birth of LL. And even though, at that time, it was given up for lack of ‘any logical justification’ (quoting the author), it contained rough versions of many concepts that were better understood, precisely introduced and developed much later, like differentiation and Taylor expansion for proofs. Around 2003, and thanks to the developments of LL and of the whole research area between logic and theoretical computer science, Ehrhard could come back to these fundamental intuitions and introduce the structure of finiteness space, allowing to reformulate this quantitative approach in a standard algebraic setting. The interpretation of LL in the category Fin of finiteness spaces and finitary relations suggested to Ehrhard and Regnier the differential extensions of LL and of the simply typed λ-calculus: Differential Linear Logic (DiLL) and the differential λ-calculus. The theory of LL proof-nets could be straightforwardly extended to DiLL, and a very natural notion of Taylor expansion of a proof-net (and of a λ-term) was introduced: an element of the Taylor expansion of the proof-net/term α is itself a (differential) proof-net/term and an approximation of α.

2021 ◽  
Vol Volume 17, Issue 4 ◽  
Author(s):  
Jules Chouquet ◽  
Lionel Vaux Auclair

We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this constraint and reducing to a fixed resultant net. This result gives a sufficient condition for an infinite weighted sum of nets to reduce into another sum of nets, while keeping coefficients finite. We moreover show that our constraints are stable under reduction. Our approach is motivated by the quantitative semantics of linear logic: many models have been proposed, whose structure reflect the Taylor expansion of multiplicative exponential linear logic (MELL) proof nets into infinite sums of differential nets. In order to simulate one cut elimination step in MELL, it is necessary to reduce an arbitrary number of cuts in the differential nets of its Taylor expansion. It turns out our results apply to differential nets, because their cut elimination is essentially multiplicative. We moreover show that the set of differential nets that occur in the Taylor expansion of an MELL net automatically satisfies our constraints. Interestingly, our nets are untyped: we only rely on the sequentiality of linear logic nets and the dynamics of cut elimination. The paths on which we impose bounds are the switching paths involved in the Danos--Regnier criterion for sequentiality. In order to accommodate multiplicative units and weakenings, our nets come equipped with jumps: each weakening node is connected to some other node. Our constraint can then be summed up as a bound on both the length of switching paths, and the number of weakenings that jump to a common node.


2014 ◽  
Vol 26 (5) ◽  
pp. 789-828 ◽  
Author(s):  
WILLEM HEIJLTJES ◽  
LUTZ STRAßBURGER
Keyword(s):  

In this paper, it is proved that Girard's proof nets for multiplicative linear logic characterize free semi-star-autonomous categories.


2016 ◽  
Vol 28 (4) ◽  
pp. 472-507 ◽  
Author(s):  
MARIE KERJEAN ◽  
CHRISTINE TASSON

In this paper, we describe a denotational model of Intuitionist Linear Logic which is also a differential category. Formulas are interpreted as Mackey-complete topological vector space and linear proofs are interpreted as bounded linear functions. So as to interpret non-linear proofs of Linear Logic, we use a notion of power series between Mackey-complete spaces, generalizing entire functions in $\mathbb{C}$. Finally, we get a quantitative model of Intuitionist Differential Linear Logic, with usual syntactic differentiation and where interpretations of proofs decompose as a Taylor expansion.


1994 ◽  
Vol 59 (2) ◽  
pp. 543-574 ◽  
Author(s):  
Samson Abramsky ◽  
Radha Jagadeesan

AbstractWe present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a natural notion of polarity, leading to a refined treatment of the additives. We make comparisons with related work by Joyal, Blass, et al.


Author(s):  
Sergey Slavnov

Abstract Ehrhard et al. (2018. Proceedings of the ACM on Programming Languages, POPL 2, Article 59.) proposed a model of probabilistic functional programming in a category of normed positive cones and stable measurable cone maps, which can be seen as a coordinate-free generalization of probabilistic coherence spaces (PCSs). However, unlike the case of PCSs, it remained unclear if the model could be refined to a model of classical linear logic. In this work, we consider a somewhat similar category which gives indeed a coordinate-free model of full propositional linear logic with nondegenerate interpretation of additives and sound interpretation of exponentials. Objects are dual pairs of normed cones satisfying certain specific completeness properties, such as existence of norm-bounded monotone weak limits, and morphisms are bounded (adjointable) positive maps. Norms allow us a distinct interpretation of dual additive connectives as product and coproduct. Exponential connectives are modeled using real analytic functions and distributions that have representations as power series with positive coefficients. Unlike the familiar case of PCSs, there is no reference or need for a preferred basis; in this sense the model is invariant. PCSs form a full subcategory, whose objects, seen as posets, are lattices. Thus, we get a model fitting in the tradition of interpreting linear logic in a linear algebraic setting, which arguably is free from the drawbacks of its predecessors.


Author(s):  
M. Bakhouya ◽  
J. Gaber

The recent evolution of network connectivity from wired connection to wireless to mobile access together with their crossing has engendered their widespread use with new network-computing challenges. More precisely, network infrastructures are not only continuously growing, but their usage is also changing and they are now considered to be the foundation of other new technologies. A related research area concerns ubiquitous and pervasive computing systems and their applications. The design and development of ubiquitous and pervasive applications require new operational models that will permit an efficient use of resources and services, and a reduction of the need for the administration effort typical in client-server networks (Gaber, 2000, 2006). More precisely, in ubiquitous and pervasive computing, to be able to develop and implement applications, new ways and techniques for resource and service discovery and composition need to be developed.


2009 ◽  
Vol 424 ◽  
pp. 129-135 ◽  
Author(s):  
Kai Kittner ◽  
Birgit Awiszus

Due to a changing environmental awareness and the improved use of resources, the application of light-weight materials, such as aluminium and magnesium, becomes increasingly important and partially substitutes the utilisation of conventional materials such as steel. However, a widespread application demands a better understanding of these materials. This concerns production processes of semi-finished products and the products itself. Coextruded aluminium-magnesium compounds are investigated in the subproject B3 (“Experimental and numerical investigations of the interface behavior of Al-Mg compounds”) which is part of the special research area 692 – HALS at the Chemnitz University of Technology. These compounds are characterized by a very good weight-strength-ratio and allow a wide field of application, for example in automotive industry. The compounds are manufactured in extrusion processes. The interface which is developed during the production is of special interest and the investigation of it is a shared aim of the Department of Experimental Mechanics and the Department of Virtual Production Processes. The two main tasks are the extrusion process optimisation and the microstructural, mechanical and thermal examination of the semi-finished product. The following paper gives an overview of the performed investigations in this subproject.


Sign in / Sign up

Export Citation Format

Share Document