Complete Call-by-Value Calculi of Control Operators, I

07/07/2017
by   Ryu Hasegawa, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2017

Complete Call-by-Value Calculi of Control Operators II: Strong Termination

We provide characterization of the strong termination property of the CC...
research
02/14/2018

On completeness and parametricity in the realizability semantics of System F

A general approach to the realizability semantics of System F is obtaine...
research
05/04/2023

Type System for Four Delimited Control Operators

The operational behavior of control operators has been studied comprehen...
research
06/05/2023

Distributed Autoepistemic Logic: Semantics, Complexity, and Applications to Access Control

In this paper we define and study a multi-agent extension of autoepistem...
research
10/14/2021

A Functional Abstraction of Typed Invocation Contexts

In their paper "A Functional Abstraction of Typed Contexts", Danvy and F...
research
07/15/2017

Memoisation: Purely, Left-recursively, and with (Continuation Passing) Style

Memoisation, or tabling, is a well-known technique that yields large imp...
research
11/19/2021

Continuation-Passing Style, Defunctionalization, Accumulations, and Associativity

Context: Reynolds showed us how to use continuation-passing style and de...

Please sign up or login with your details

Forgot password? Click here to reset