Results 1  10
of
12
Relational parametricity and control
 Logical Methods in Computer Science
"... www.lmcsonline.org ..."
(Show Context)
Duality between CallbyName Recursion and CallbyValue Iteration
 IN PROC. COMPUTER SCIENCE LOGIC, SPRINGER LECTURE NOTES IN COMPUT. SCI
, 2001
"... We investigate the duality between callbyname recursion and callbyvalue iteration on the λµcalculi. The duality between callbyname and callbyvalue was first studied by Filinski, and Selinger has studied the categorytheoretic duality on the models of the callbyname λµcalculus and the cal ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
(Show Context)
We investigate the duality between callbyname recursion and callbyvalue iteration on the λµcalculi. The duality between callbyname and callbyvalue was first studied by Filinski, and Selinger has studied the categorytheoretic duality on the models of the callbyname λµcalculus and the callbyvalue one. We extend the callbyname λµcalculus and the callbyvalue one with a fixedpoint operator and an iteration operator, respectively. We show that the dual translations constructed by Selinger can be expanded into our extended λµcalculi, and we also discuss their implications to practical applications.
On the callbyvalue CPS transform and its semantics
, 2004
"... We investigate continuations in the context of idealized callbyvalue programming languages. On the semantic side, we analyze the categorical structures that arise from continuation models of callbyvalue languages. On the syntactic side, we study the callbyvalue continuationpassing transformat ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We investigate continuations in the context of idealized callbyvalue programming languages. On the semantic side, we analyze the categorical structures that arise from continuation models of callbyvalue languages. On the syntactic side, we study the callbyvalue continuationpassing transformation as a translation between equational theories. Among the novelties are an unusually simple axiomatization of control operators and a strengthened completeness result with a proof based on a delaying transform.
Parameterizations and FixedPoint Operators on Control Categories
 Fundam. Inform
, 2005
"... The #calculus features both variables and names, together with their binding mechanisms. This means that constructions on open terms are necessarily parameterized in two di#erent ways for both variables and names. Semantically, such a construction must be modeled by a biparameterized family of ope ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
The #calculus features both variables and names, together with their binding mechanisms. This means that constructions on open terms are necessarily parameterized in two di#erent ways for both variables and names. Semantically, such a construction must be modeled by a biparameterized family of operators. In this paper, we study these biparameterized operators on Selinger's categorical models of the # calculus called control categories. The overall development is analogous to that of Lambek's functional completeness of cartesian closed categories via polynomial categories. As a particular and important case, we study parameterizations of uniform fixedpoint operators on control categories, and show bijective correspondences between parameterized fixedpoint operators and nonparameterized ones under uniformity conditions.
Relating computational effects by ⊤⊤lifting, in
 of Lecture Notes in Computer Science
"... We consider the problem of establishing a relationship between two interpretations of base type terms of a λccalculus extended with algebraic operations. We show that the given relationship holds if it satisfies a set of natural conditions. We apply this result to 1) comparing two monadic semantics ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We consider the problem of establishing a relationship between two interpretations of base type terms of a λccalculus extended with algebraic operations. We show that the given relationship holds if it satisfies a set of natural conditions. We apply this result to 1) comparing two monadic semantics related by a strong monad morphism, and 2) comparing two monadic semantics of fresh name creation: Stark’s new name creation monad [32], and the global counter monad. We also consider the same problem, relating semantics of computational effects, in the presence of recursive functions. We apply this additional by extending the previous monad morphism comparison result to the recursive case.
Polarized Proof Nets with Cycles and Fixpoints Semantics
"... Abstract. Starting from Laurent’s work on Polarized Linear Logic, we define a new polarized linear deduction system which handles recursion. This is achieved by extending the cutrule, in such a way that iteration unrolling is achieved by cutelimination. The proof nets counterpart of this extension ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Starting from Laurent’s work on Polarized Linear Logic, we define a new polarized linear deduction system which handles recursion. This is achieved by extending the cutrule, in such a way that iteration unrolling is achieved by cutelimination. The proof nets counterpart of this extension is obtained by allowing oriented cycles, which had no meaning in usual polarized linear logic. We also free proof nets from additional constraints, leading up to a correctness criterion as straightforward as possible (since almost all proof structures are correct). Our system has a sound semantics expressed in traced models. 1
and
"... Layout randomization is a powerful, popular technique for software protection. We present it and study it in programminglanguage terms. More specifically, we consider layout randomization as part of an implementation for a highlevel programming language; the implementation translates this language ..."
Abstract
 Add to MetaCart
(Show Context)
Layout randomization is a powerful, popular technique for software protection. We present it and study it in programminglanguage terms. More specifically, we consider layout randomization as part of an implementation for a highlevel programming language; the implementation translates this language to a lowerlevel language in which memory addresses are numbers. We analyze this implementation, by relating lowlevel attacks against the implementation to contexts in the
unknown title
"... We study the equational theory of Parigot’s secondorder λµcalculus in connection with a callbyname continuationpassing style (CPS) translation into a fragment of the secondorder λcalculus. It is observed that the relational parametricity on the target calculus induces a natural notion of equiv ..."
Abstract
 Add to MetaCart
(Show Context)
We study the equational theory of Parigot’s secondorder λµcalculus in connection with a callbyname continuationpassing style (CPS) translation into a fragment of the secondorder λcalculus. It is observed that the relational parametricity on the target calculus induces a natural notion of equivalence on the λµterms. On the other hand, the unconstrained relational parametricity on the λµcalculus turns out to be inconsistent with this CPS semantics. Following these facts, we propose to formulate the relational parametricity on the λµcalculus in a constrained way, which might be called “focal parametricity”. 1.
Abstract Lightweight Fusion by Fixed Point Promotion ∗
"... This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features: it works for general recursive functions on general algebraic data types; it does not produce extra runtime overhead (e ..."
Abstract
 Add to MetaCart
(Show Context)
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features: it works for general recursive functions on general algebraic data types; it does not produce extra runtime overhead (except for possible code size increase due to the success of fusion); and it is readily incorporated in standard inlining optimization. This is achieved by extending the ordinary inlining process with a new fusion law that transforms a term of the form f ◦ (fix g.λx.E) to a new fixed point term fix h.λx.E ′ by promoting the function f through the fixed point operator. This is a sound syntactic transformation rule that is not sensitive to the types of f and g. This property makes our method applicable to wide range of functions including those with multiparameters in both curried and uncurried forms. Although this method does not guarantee any form of completeness, it fuses typical examples discussed in the literature and others that involve accumulating parameters, either in the foldllike specific forms or in general recursive forms, without any additional machinery. In order to substantiate our claim, we have implemented our method in a compiler. Although it is preliminary, it demonstrates practical feasibility of this method.