Expressive Completeness of an Event-Pattern Reactive Programming Language

Autor:	Matteo Slanina, Henny B. Sipma, Zohar Manna, César Sánchez
Rok vydání:	2005
Předmět:	Programming language Event (computing) Computer science media_common.quotation_subject Expression (computer science) computer.software_genre Completeness (order theory) Reactive programming Simplicity Algorithm computer Reactive system Declarative programming media_common
Zdroj:	Formal Techniques for Networked and Distributed Systems-FORTE 2005 ISBN: 9783540291893 FORTE
DOI:	10.1007/11562436_39
Popis:	Event-pattern reactive programs serve reactive components by pre-processing the input event stream and generating notifications according to temporal patterns. The declarative language PAR allows the expression of complex event-pattern reactions. Despite its simplicity and deterministic nature, PAR is expressively complete in the following sense: every event-pattern reactive system that can be described and implemented using finite memory can also be expressed inPAR
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::243056eb6cb691097d729fc7f0fc0c48 https://doi.org/10.1007/11562436_39 Zobrazit plný text záznamu