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

02/09/2021
by   Yann Hamdaoui, et al.
0

In this paper we introduce a typed, concurrent λ-calculus with references featuring explicit substitutions for variables and references. Alongside usual safety properties, we recover strong normalization. The proof is based on a reducibility technique and an original interactive property reminiscent of the Game Semantics approach.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

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...
02/17/2021

Small, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting

Several proof assistants, such as Isabelle or Coq, can concurrently chec...
05/25/2021

Tracking Captured Variables in Types

Type systems usually characterize the shape of values but not their free...
05/03/2017

Concurrent Constraint Conditional-Branching Timed Interactive Scores

Multimedia scenarios have multimedia content and interactive events asso...
02/10/2021

Interpreting a concurrent λ-calculus in differential proof nets (extended version)

In this paper, we show how to interpret a language featuring concurrency...
06/04/2018

On the Soundness of Coroutines with Snapshots

Coroutines are a general control flow construct that can eliminate contr...
04/06/2020

Responsive Parallelism with Futures and State

Motivated by the increasing shift to multicore computers, recent work ha...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.