Dependent Types for Multi-Rate Flows in Synchronous Programming

William Blair
(Boston University)
Hongwei Xi
(Boston University)

Synchronous programming languages emerged in the 1980s as tools for implementing reactive systems, which interact with events from physical environments and often must do so under strict timing constraints. In this report, we encode inside ATS various real-time primitives in an experimental synchronous language called Prelude, where ATS is a statically typed language with an ML-like functional core that supports both dependent types (of DML-style) and linear types. We show that the verification requirements imposed on these primitives can be formally expressed in terms of dependent types in ATS. Moreover, we modify the Prelude compiler to automatically generate ATS code from Prelude source. This modified compiler allows us to solely rely on typechecking in ATS to discharge proof obligations originating from the need to typecheck Prelude code. Whereas ATS is typically used as a general purpose programming language, we hereby demonstrate that it can also be conveniently used to support some forms of advanced static checking in languages equipped with less expressive types.

System Description in Jeremy Yallop and Damien Doligez: Proceedings ML Family / OCaml Users and Developers workshops (ML/OCaml 2015), Vancouver, Canada, 3rd & 4th September 2015, Electronic Proceedings in Theoretical Computer Science 241, pp. 36–44.
Published: 7th February 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.241.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org