HOπ in Coq

Sergueï Lenglet 1 Alan Schmitt 2
2 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA_D4 - LANGAGE ET GÉNIE LOGICIEL
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01614987
Contributor : Sergueï Lenglet <>
Submitted on : Tuesday, November 28, 2017 - 4:18:47 PM
Last modification on : Wednesday, February 20, 2019 - 2:32:03 PM

File

cpp18.pdf
Files produced by the author(s)

Identifiers

Citation

Sergueï Lenglet, Alan Schmitt. HOπ in Coq. CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2018, Los Angeles, United States. ⟨10.1145/3167083⟩. ⟨hal-01614987v2⟩

Share

Metrics

Record views

266

Files downloads

37