Monadic translation of classical sequent calculus

نویسندگان

  • José Espírito Santo
  • Ralph Matthes
  • Koji Nakazawa
  • Luís Pinto
چکیده

We study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fragments of the classical sequent calculus λμμ̃ by Curien and Herbelin and give modular and syntactic proofs of strong normalization. The target of the translations is a new meta-language for classical logic, named monadic λμ. It is a monadic reworking of Parigot’s λμ-calculus, where the monadic binding is confined to commands, thus integrating the monad with the classical features. Also its μ-reduction rule is replaced by one expressing the interaction between monadic binding and μ-abstraction.

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

ثبت نام

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

منابع مشابه

Monadic Translation of Intuitionistic Sequent Calculus

This paper proposes and analyses a monadic translation of an intuitionistic sequent calculus. The source of the translation is a typed λ-calculus previously introduced by the authors, corresponding to the intuitionistic fragment of the call-by-name variant of λμμ̃ of Curien and Herbelin, and the target is a variant of Moggi’s monadic meta-language, where the rewrite relation includes extra permu...

متن کامل

Combinatorial Proof Semantics

The paper Proofs Without Syntax [Annals of Mathematics, to appear] introduced the notion of a combinatorial proof for classical propositional logic. The present paper uses combinatorial proofs to define a semantics for classical propositional sequent calculus, an inductive translation from sequent proofs to combinatorial proofs. The semantics is abstract and efficient: abstract in the sense tha...

متن کامل

Truthful Monadic Abstractions

In intuitionistic sequent calculi, detecting that a sequent is unprovable is often used to direct proof search. This is for instance seen in backward chaining, where an unprovable subgoal means that the proof search must backtrack. In undecidable logics, however, proof search may continue indefinitely, finding neither a proof nor a disproof of a given subgoal. In this paper we characterize a fa...

متن کامل

Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract)

We exploit a system of realizers for classical logic, and a translation from resolution into the sequent calculus, to assess the in-tuitionistic force of classical resolution for a fragment of intuitionistic logic. This approach is in contrast to formulating locally intuitionistically sound resolution rules. The techniques use the-calculus, a development of Parigot's-calculus.

متن کامل

Order-enriched Categorical Models of the Classical Sequent Calculus

It is well-known that weakening and contraction cause naı̈ve categorical models of the classical sequent calculus to collapse to Boolean lattices. Starting from a convenient formulation of the well-known categorical semantics of linear classical sequent proofs, we give models of weakening and contraction that do not collapse. Cut-reduction is interpreted by a partial order between morphisms. Our...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2013