HOπ in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2020

HOπ in Coq

Abstract

We present a formalization of HOπ in Coq, 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. For the latter, we compare four approaches to represent binders: locally nameless, de Bruijn indices, nominal, and Higher-Order Abstract Syntax. In each case, we formalize strong context bisimi-larity and prove it is compatible, i.e., closed under every context, using Howe's method, based on several proof schemes we developed in a previous paper.
Fichier principal
Vignette du fichier
jar.pdf (602.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02536463 , version 1 (08-04-2020)
hal-02536463 , version 2 (04-09-2020)

Identifiers

Cite

Guillaume Ambal, Sergueï Lenglet, Alan Schmitt. HOπ in Coq. Journal of Automated Reasoning, 2020, ⟨10.1007/s10817-020-09553-0⟩. ⟨hal-02536463v2⟩
290 View
491 Download

Altmetric

Share

Gmail Facebook X LinkedIn More