A verified abstract machine for functional coroutines - Archive ouverte HAL Access content directly
Journal Articles Electronic Proceedings in Theoretical Computer Science Year : 2016

A verified abstract machine for functional coroutines

Tristan Crolard

Abstract

Functional coroutines are a restricted form of control mechanism, where each coroutine is represented with both a continuation and an environment. This restriction was originally obtained by considering a constructive version of Parigot's classical natural deduction which is sound and complete for the Constant Domain logic. In this article, we present a refinement of de Groote's abstract machine for functional coroutines and we prove its correctness. Therefore, this abstract machine also provides a direct computational interpretation of the Constant Domain logic.

Dates and versions

hal-02457406 , version 1 (28-01-2020)

Identifiers

Cite

Tristan Crolard. A verified abstract machine for functional coroutines. Electronic Proceedings in Theoretical Computer Science, 2016, 212, pp.1-17. ⟨10.4204/EPTCS.212.1⟩. ⟨hal-02457406⟩
34 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More