The Semantic Layers of Timber Export

@book{citeulike:266390, abstract = {We present a three-layered semantics of Timber, a language designed for programming real-time systems in a reactive, object-oriented style. The innermost layer amounts to a traditional deterministic, pure, functional language, around which we formulate a middle layer of concurrent objects, in terms of a monadic transition semantics. The outermost layer, where the language is married to deadline-driven scheduling theory, is where we define message ordering and CPU allocation to actions. Our main contributions are a formalized notion of a time-constrained reaction, and a demonstration of how scheduling theory, process calculii, and the lambda calculus can be jointly applied to obtain a direct and succinct semantics of a complex, real-world programming language with well-defined real-time behavior.}, author = {Carlsson, Magnus and Nordlander, Johan and Kieburtz, Dick}, citeulike-article-id = {266390}, citeulike-linkout-0 = {http://www.metapress.com/content/8D636Q91U9B63NY2}, journal = {Lecture Notes in Computer Science}, keywords = {concurrency, embedded-systems, functional-programming, haskell, monads, objects, real-time, side-effects}, month = {January}, pages = {339--356}, posted-at = {2005-09-13 08:26:38}, priority = {0}, title = {The Semantic Layers of Timber}, url = {http://www.metapress.com/content/8D636Q91U9B63NY2}, volume = {2895}, year = {2003} }

TY - BOOK ID - citeulike:266390 L3 - citeulike-article-id:266390 N2 - We present a three-layered semantics of Timber, a language designed for programming real-time systems in a reactive, object-oriented style. The innermost layer amounts to a traditional deterministic, pure, functional language, around which we formulate a middle layer of concurrent objects, in terms of a monadic transition semantics. The outermost layer, where the language is married to deadline-driven scheduling theory, is where we define message ordering and CPU allocation to actions. Our main contributions are a formalized notion of a time-constrained reaction, and a demonstration of how scheduling theory, process calculii, and the lambda calculus can be jointly applied to obtain a direct and succinct semantics of a complex, real-world programming language with well-defined real-time behavior. JF - Lecture Notes in Computer Science EP - 356 TI - The Semantic Layers of Timber VL - 2895 SP - 339 KW - concurrency KW - embedded-systems KW - functional-programming KW - haskell KW - monads KW - objects KW - real-time KW - side-effects AU - Carlsson, Magnus AU - Nordlander, Johan AU - Kieburtz, Dick PY - 2003/01// UR - http://www.metapress.com/content/8D636Q91U9B63NY2 ER -