DeepAI AI Chat

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

07/07/2017

∙

by Ryu Hasegawa, et al.

∙

∙

We provide characterization of the strong termination property of the CCV lambda-mu 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 semantics and typeability.

page 1

page 2

page 3

page 4

∙ 07/07/2017

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

We give new call-by-value calculi of control operators that are complete...

0 Ryu Hasegawa, et al. ∙

∙ 02/09/2021

An Interactive Proof of Termination for a Concurrent λ-calculus with References and Explicit Substitutions

In this paper we introduce a typed, concurrent λ-calculus with reference...

0 Yann Hamdaoui, et al. ∙

∙ 06/22/2019

Strong Bisimulation for Control Operators

The purpose of this paper is to identify programs with control operators...

0 Eduardo Bonelli, et al. ∙

∙ 12/14/2018

Observability = Typability + Inhabitation

We define an observability property for a calculus with pattern matching...

0 Antonio Bucciarelli, et al. ∙

∙ 06/02/2014

A Superposition Calculus for Abductive Reasoning

We present a modification of the superposition calculus that is meant to...

0 Mnacho Echenim, et al. ∙

∙ 01/14/2021

A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction

The purpose of this paper is to identify programs with control operators...

0 Eduardo Bonelli, et al. ∙

∙ 03/21/2022

Curry and Howard Meet Borel

We show that an intuitionistic version of counting propositional logic c...

0 Melissa Antonelli, et al. ∙