Complete Call-by-Value Calculi of Control Operators, I
نویسنده
چکیده
We give new call-by-value calculi of control operators that are complete for the continuation-passing style semantics. Various anticipated computational properties are induced from the completeness. In the first part of a series of papers, we give the characterization of termination properties using the continuation-passing style semantics as well as the union-intersection type discipline.
منابع مشابه
A Call-by-Name CPS Hierarchy
The Continuation-Passing-Style (CPS) translation gives semantics to control operators such as exception and first-class continuations. By iterating this translation, Danvy and Filinski obtained a CPS hierarchy, and used it to specify a series of control operators, hierarchical (or layered) delimited-control operators, We introduce a call-by-name variant of the CPS hierarchy. While most of the w...
متن کاملA call-by-value lambda-calculus with lists and control
Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also include data types. As a step into that direction, this paper defines a simply typed call-by-value λ -calculus with the control operators catch and throw, a data t...
متن کاملA call-by-value λ -calculus with lists and control
Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also include data types. As a step into that direction, this paper defines a simply typed call-by-value λ -calculus with the control operators catch and throw, a data t...
متن کامل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...
متن کاملProving Soundness of Extensional Normal-Form Bisimilarities
Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in lambda-calculi by decomposing their normal forms into bisimilar subterms. Besides, they allow for powerful up-to techniques, such as bisimulation up to context, which simplify bisimulation proofs even further. However, proving soundness of these relations becomes complicated in the presence of eta-exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.02056 شماره
صفحات -
تاریخ انتشار 2017