Confluency and Strong Normalizability of Call-by-Value λμ-Calculus
نویسنده
چکیده
This paper proves the confluency and the strong normalizability of the call-by-value λμcalculus with the domain-free style. The confluency of the system is proved by improving the parallel reduction method of Baba, Hirokawa and Fujita. The strong normalizability is proved by using the modified CPS-translation, which preserves the typability and the reduction relation. This paper defines the class of the reductions whose strictness is preserved by the modified CPS-translation to prove the strong normalizability.
منابع مشابه
Calculi for Intuitionistic Normal Modal Logic
This paper provides a call-by-name and a call-by-value term calculus, both of which have a Curry-Howard correspondence to the box fragment of the intuitionistic modal logic IK. The strong normalizability and the confluency of the calculi are shown. Moreover, we define a CPS transformation from the call-by-value calculus to the call-by-name calculus, and show its soundness and completeness.
متن کاملComplete Call-by-Value Calculi of Control Operators II: Strong Termination
We provide characterization of the strong termination property of the CCV λμ-calculus introduced in the first part of the series of the paper. The calculus is complete with respect to the standard CPS semantics. The union-intersection type systems for the calculus is developed in the previous paper. We characterize the strong normalizability of terms of the calculus in terms of the CPS semantic...
متن کاملConfluency property of the call-by-value λμ-calculus
Gentzen (1955) introduced the natural deduction system to study the notion of proof. The full classical natural deduction system is well adapted for the human reasoning. By full we mean that all the connectives (→, ∧ and ∨) and ⊥ (for the absurdity) are considered as primitive. As usual, the negation is defined by ¬A = A → ⊥. Considering this logic from the computer science of view is interesti...
متن کاملDuality between Call-by-Name Recursion and Call-by-Value Iteration
We investigate the duality between call-by-name recursion and call-by-value iteration in the λμ-calculi and their models. Semantically, we consider that iteration is the dual notion of recursion. Syntactically, we extend the call-by-name λμ-calculus and the call-by-value one with a fixed-point operator and an iteration operator, respectively. This paper shows that the dual translations between ...
متن کاملMonadic translation of classical sequent calculus
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 confi...
متن کامل