Timed CCP compositionally embeds Argos and Lustre
We prove that both the synchronous data-flow language Lustre restricted to types with finite values and the synchronous state-oriented language Argos are embedded in the synchronous paradigm Timed Concurrent Constraint Programming (tccp). In fact, for each of the two languages we provide a tccp lang...
Uloženo v:
| Vydáno v: | Formal aspects of computing Ročník 16; číslo 3; s. 292 - 312 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
London
Association for Computing Machinery
01.08.2004
|
| ISSN: | 0934-5043, 1433-299X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | We prove that both the synchronous data-flow language Lustre restricted to types with finite values and the synchronous state-oriented language Argos are embedded in the synchronous paradigm Timed Concurrent Constraint Programming (tccp). In fact, for each of the two languages we provide a tccp language encoding it compositionally with respect to the syntax of programs and linearly with respect to the size of programs. Besides giving results of expressiveness for tccp, our encodings permit us to obtain a language tailored for programming reactive systems where both control handling aspects and data processing aspects are relevant. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| ISSN: | 0934-5043 1433-299X |
| DOI: | 10.1007/s00165-004-0041-x |