Preprints, Working Papers, ... Year : 2017

HOπ in Coq

Abstract

We propose a formalization in Coq of HOπ , a process calculus where messages carry processes. Such a higher-order calculus features two very different kinds of binder: process input, similar to λ-abstraction, and name restriction, whose scope can be expanded by communication. We formalize strong context bisimilarity and prove it is compatible using Howe's method, based on several proof schemes we developed in a previous paper.
Fichier principal
Vignette du fichier
cpp18.pdf (695.99 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01614987 , version 1 (11-10-2017)
hal-01614987 , version 2 (28-11-2017)
hal-01614987 , version 3 (15-12-2017)

Identifiers

  • HAL Id : hal-01614987 , version 1

Cite

Sergueï Lenglet, Alan Schmitt. HOπ in Coq. 2017. ⟨hal-01614987v1⟩
1168 View
690 Download

Share

More