Representing Layered Monads Export

@inproceedings{citeulike:4746711, abstract = {There has already been considerable research on constructing modular, monad-based specications of computational eects (state, exceptions, nondeterminism, etc.) in programming languages. We present a simple framework in this tradition, based on a Church-style eect-typing system for an ML-like language. The semantics of this language is formally dened by a series of monadic translations, each one expanding away a layer of eects. Such a layered specication is easy to reason about, but its direct implementation (whether by parameterized interpretation or by actual translation) is often prohibitively ine{\AE}cient. By exploiting deeper semantic properties of monads, however, it is also possible to derive a vastly more e{\AE}cient implementation: we show that each layer of eects can be uniformly simulated by continuation-passing, and further that multiple such layers can themselves be simulated by a standard semantics for call/cc and mutable state. Thus, even multi-eect programs can be execu...}, author = {Filinski, Andrzej}, booktitle = {Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages}, citeulike-article-id = {4746711}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2016}, keywords = {effects, monads, semantics}, pages = {175--188}, posted-at = {2009-06-04 22:17:41}, priority = {2}, title = {Representing Layered Monads}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2016}, year = {1999} }

TY - CONF ID - citeulike:4746711 L3 - citeulike-article-id:4746711 N2 - There has already been considerable research on constructing modular, monad-based specications of computational eects (state, exceptions, nondeterminism, etc.) in programming languages. We present a simple framework in this tradition, based on a Church-style eect-typing system for an ML-like language. The semantics of this language is formally dened by a series of monadic translations, each one expanding away a layer of eects. Such a layered specication is easy to reason about, but its direct implementation (whether by parameterized interpretation or by actual translation) is often prohibitively ineÆcient. By exploiting deeper semantic properties of monads, however, it is also possible to derive a vastly more eÆcient implementation: we show that each layer of eects can be uniformly simulated by continuation-passing, and further that multiple such layers can themselves be simulated by a standard semantics for call/cc and mutable state. Thus, even multi-eect programs can be execu... EP - 188 TI - Representing Layered Monads T2 - Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages SP - 175 KW - effects KW - monads KW - semantics AU - Filinski, Andrzej PY - 1999/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2016 ER -