On the Curry-Howard Interpretation of a Fragment of Classical Linear Logic with Subexponentials

نویسندگان

  • Chuck Liang
  • Dale Miller
چکیده

We construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski [6]. However, instead of relying on nested CPS translations, these operators give directly a Curry-Howard interpretation of a fragment of linear logic extended with subexponentials, i.e., multiple pairs of ! and ?. We show how the fundamental problem of delimited control, from the perspective of logic, is the combination of classical and non-classical inference within one system and how subexponentials give a new approach to combining classical and intuitionistic logics. A natural deduction system called MC (multi-colored classical logic) is formulated with proof terms that include indexed control operators. We then define a call-by-value evaluation strategy for these terms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine

Interaction nets are graph rewriting systems which are a generalisation of proof nets for classical linear logic. The linear chemical abstract machine (CHAM) is a term rewriting system which corresponds to classical linear logic, via the Curry-Howard isomorphism. We can obtain a textual calculus for interaction nets which is surprisingly similar to linear CHAM based on the multiplicative fragme...

متن کامل

Constructive linear-time temporal logic: Proof systems and Kripke semantics

In this paper we study a version of constructive linear-time temporal logic (LTL) with the “next” temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time analysis via the Curry-Howard isomorphism. However, he did not investigate the logic itself in detail; he has proved only that the logic augmented...

متن کامل

Lambda Calculus and Intuitionistic Linear Logic

The Curry-Howard isomorphism 1 is the basis of typed functional programming. By means of this isomorphism, the intuitionistic proof of a formula can be seen as a functional program, whose type is the formula itself. In this way, the computation process has its logic realization in the proof normalization procedure. Both the implicative fragment of the intuitionistic propositional logic together...

متن کامل

A Concurrent Model for Linear Logic

We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly concurrent behaviours. Then we study how embeddings of intuitionistic and classical logics into line...

متن کامل

Projecting Games on Hypercoherences

We compare two interpretations of programming languages: game semantics (a dynamic semantics dealing with computational traces) and hypercoherences (a static semantics dealing with results of computation). We consider polarized bordered games which are Laurent’s polarized games endowed with a notion of terminated computation (the border) allowing for a projection on hypercoherences. The main re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015