An Adequate While-Language for Hybrid Computation release_t5xkcg5ghzf43fbjwrbdgwlte4

by Sergey Goncharov, Renato Neves

Released as a article .

2019  

Abstract

Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours bear signs of both computational and physical processes, and thus present difficulties not only for analysis, but also for describing them adequately in a structural, well-founded way. Here, we introduce a language for hybrid computation, inspired by the fine-grain call-by-value paradigm, and equip it with a denotational and computationally adequate denotational semantics. Our denotational semantics crucially relies on a hybrid monad supporting an (Elgot) iteration operator, we developed elsewhere. As an intermediate step we introduce a more lightweight duration semantics furnished with analogous results and drawing on a new duration monad that we introduce as a lightweight counterpart to the hybrid monad.
In text/plain format

Archived Files and Locations

application/pdf  1.0 MB
file_z5xkkbhmq5blte7azybywp2voq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-07-17
Version   v2
Language   en ?
arXiv  1902.07684v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: fab4d279-1e20-4ca2-92bc-5b5e8f1c813c
API URL: JSON