Linear λμ is CP (more or less)
نویسندگان
چکیده
In this paper we compare Wadler’s CP calculus for classical linear processes to a linear version of Parigot’s λμ calculus for classical logic. We conclude that linear λμ is “more or less” CP, in that it equationally corresponds to a polarized version of CP. The comparison is made by extending a technique from Melliès and Tabareau’s tensor logic that correlates negation with polarization. The polarized CP, which is written CP± and pronounced “CP more or less,” is an interesting bridge in the landscape of Curry-Howard interpretations of logic.
منابع مشابه
Complexity Analysis in Presence of Control Operators and Higher-Order Functions
A polarized version of Girard, Scedrov and Scott’s Bounded Linear Logic is introduced and its normalization properties studied. Following Laurent [26], the logic naturally gives rise to a type system for the λμ-calculus, whose derivations reveal bounds on the time complexity of the underlying term. This is the first example of a type system for the λμ-calculus guaranteeing time complexity bound...
متن کاملبررسی فراوانی انواع دفرمیتی های پا در بیماران فلج مغزی 3 تا 20 سال مراجعه کننده به بیمارستان شفا یحیائیان تهران
Introduction & Objective: In patients with cerebral palsy (CP) the most common presentation is lower extremity deformity specially foot deformity. Inability to ambulation is the one of the most important disabilities, that dependent to the variety of factors such as severity of disease, kind of CP, etc. This study was aimed to assess prevalence of kinds of foot deformity in CP and communication...
متن کاملCompleteness of Continuation Models for lm-Calculus
We show that a certain simple call-by-name continuation semantics of Parigot’s λμ-calculus is complete. More precisely, for every λμ-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of λμ, which maps terms to functions sending abstract continuations to responses, is full and faithful. Thus, any λμ-category in the sense of L. Ong (1996, in “...
متن کاملTyping streams in the Λμ-calculus: extended abstract
Λμ-calculus [11] has been built as an untyped extension of the λμ-calculus [10] in order to recover Böhm theorem which was known to fail in λμ-calculus since a result by David & Py [2]. An essential computational feature of Λμ-calculus for separation to hold is the unrestricted use of abstractions over continuation variables that provides the calculus with a construction of streams. In [11], Λμ...
متن کاملStandardization and Böhm trees for Λμ-calculus
Λμ-calculus is an extension of Parigot's λμ-calculus which (i) satis es Separation theorem: it is Böhm-complete, (ii) corresponds to CBN delimited control and (iii) is provided with a stream interpretation. In the present paper, we study solvability and investigate Böhm trees for Λμ-calculus. Moreover, we make clear the connections between Λμcalculus and in nitary λ-calculi. After establishing ...
متن کامل