Towards a higher-order synchronous data-flow language
| Autor: | Alain Girault, Grégoire Hamon, Jean-Louis Colaço, Marc Pouzet |
|---|---|
| Přispěvatelé: | Sémantiques, preuves et implantation (SPI), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS) |
| Rok vydání: | 2004 |
| Předmět: |
Theoretical computer science
Computer science Programming language Object language 020207 software engineering 0102 computer and information sciences 02 engineering and technology Specification language computer.software_genre 01 natural sciences Programming language implementation Language primitive 010201 computation theory & mathematics High-level programming language Programming language specification 0202 electrical engineering electronic engineering information engineering Data control language [INFO]Computer Science [cs] computer Low-level programming language |
| Zdroj: | EMSOFT ACM Fourth International Conference on Embedded Software (EMSOFT'04) ACM Fourth International Conference on Embedded Software (EMSOFT'04), Sep 2004, Pisa, Italy. pp.230-239, ⟨10.1145/1017753.1017792⟩ |
| DOI: | 10.1145/1017753.1017792 |
| Popis: | International audience; The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfigure data-flow processes. The language comes as a natural and strict extension of both lustre and lucy. This extension is conservative, in the sense that a first-order restriction of the language can receive the same semantics.We illustrate the expressivity of the language with some examples, before giving the formal semantics of the underlying calculus. The language is equipped with a polymorphic type system allowing types to be automatically inferred and a clock calculus rejecting programs for which synchronous execution cannot be statically guaranteed. To our knowledge, this is the first higher-order synchronous data-flow language where stream functions are first class citizens. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|