Abstract
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebraic effects, a development of Moggi's monadic theory of computational effects that emphasises the operations causing the effects at hand and their equational theory. The key observation is that annotation effects can be identified with operation symbols. We develop an annotated version of Levy's Call-by-Push-Value language with a kind of computations for every effect set; it can be thought of as a sequential, annotated intermediate language. We develop a range of validated optimisations (i.e., equivalences), generalising many existing ones and adding new ones. We classify these optimisations as structural, algebraic, or abstract: structural optimisations always hold; algebraic ones depend on the effect theory at hand; and abstract ones depend on the global nature of that theory (we give modularly-checkable sufficient conditions for their validity).
Supplemental Material
- S. Abramsky and A. Jung. Hand. of Log. in CS, 3:1--168, 1994.Google Scholar
- R. Atkey. Proc. 3rd CALCO, 3--17, 2009. Google Scholar
Digital Library
- R. Atkey. JFP, 19:335--376, 2009. Google Scholar
Digital Library
- N. Benton and P. Buchlovsky. Proc. 3rd TLDI, 15--26, 2007. Google Scholar
Digital Library
- N. Benton and A. Kennedy. ENTCS, 26:3--20, 1999.Google Scholar
Cross Ref
- N. Benton et al. Proc. 11th PPDP, 301--312, 2009. Google Scholar
Digital Library
- N. Benton et al. Proc. 4th APLAS, 114--130, 2006. Google Scholar
Digital Library
- N. Benton et al. Proc. 9th PPDP, 87--96, 2007. Google Scholar
Digital Library
- B. Eckmann and P. J. Hilton. Math. Ann., 145(3):227--255, 1962.Google Scholar
Cross Ref
- A. Filinski. Proc. 26th POPL, 175--188, 1999. Google Scholar
Digital Library
- A. Filinski. TCS, 375(1--3):41--75, 2007. Google Scholar
Digital Library
- A. Filinski. Proc. 37th POPL, 483--494, 2010.Google Scholar
- C. Führmann. PhD thesis, University of Edinburgh, 2000.Google Scholar
- C. Führmann. Proc. 5th FoSSaCS, 144--158, 2002.Google Scholar
- A. D. Gordon and A. Jeffrey. J. Comput. Secur., 12:435--483, 2004. Google Scholar
Digital Library
- M. Hennessy and G. D. Plotkin. Proc. 8th MFCS, 108--120, 1979.Google Scholar
- M. Hyland and J. Power. TCS, 366(1--2):144--162, 2006. Google Scholar
Digital Library
- M. Hyland and J. Power. ENTCS, 172:437--458, 2007. Google Scholar
Digital Library
- M. Hyland, G. D. Plotkin, and J. Power. TCS, 357(1--3):70--99, 2006. Google Scholar
Digital Library
- M. Hyland et al. TCS, 375(1--3):20--40, 2007. Google Scholar
Digital Library
- B. Jacobs. Annals of Pure and Applied Logic, 69(1):73--106, 1994.Google Scholar
Cross Ref
- P. Johann et al. Proc. 25th LICS, 209--218, 2010. Google Scholar
Digital Library
- R. B. Kieburtz. Proc. 3rd ICFP, 51--62, 1998. Google Scholar
Digital Library
- A. Kock. Mathematica Scandinavia, 29:161--174, 1971.Google Scholar
Cross Ref
- P. B. Levy. Proc. 16th CSL, 232--246, 2002. Google Scholar
Digital Library
- P. B. Levy. Call-by-Push-Value, Springer, 2004.Google Scholar
- J. M. Lucassen and D. K. Gifford. Proc. 15th POPL, 47--57, 1988. Google Scholar
Digital Library
- D. Marino and T. Millstein. Proc. 4th TLDI, 39--50, 2009. Google Scholar
Digital Library
- P.-A. Melliès. Proc. 25th LICS, 150--159, 2010.Google Scholar
- J. C. Mitchell. Hand. of TCS, B:365--458, 1990.Google Scholar
- G. D. Plotkin. SIAM J. of Computing, 5:452--487, 1976.Google Scholar
Cross Ref
- G. D. Plotkin. LNCS, 4060:150--156, 2006.Google Scholar
- G. D. Plotkin and J. Power. Proc. 4th FoSSaCS, 1--24, 2001. Google Scholar
Digital Library
- G. D. Plotkin and J. Power. LNCS, 2303:342--356, 2002. Google Scholar
Digital Library
- G. D. Plotkin and J. Power. ENTCS, 73:149--163, 2004. Google Scholar
Digital Library
- G. D. Plotkin and M. Pretnar. Proc. 23rd LICS, 118--129, 2008. Google Scholar
Digital Library
- G. D. Plotkin and M. Pretnar. Proc. 19th ESOP, 80--94, 2009. Google Scholar
Digital Library
- J. Power. Theory and Applications of Categories, 6:83--93, 2000.Google Scholar
- J. Power. ENTCS, 161:59--71, 2006.Google Scholar
Cross Ref
- M. Pretnar. PhD thesis, University of Edinburgh, 2009.Google Scholar
- J. Reynolds. Proc. 2nd ICALP, 141--156, 1974. Google Scholar
Digital Library
- S. Staton. ENTCS, 249:471--490, 2009. Google Scholar
Digital Library
- T. Coquand et al. Inf. Comp., 93(1):172--221, 1991. Google Scholar
Digital Library
- M. Tofte and J.-P. Talpin. Inf. Comp., 132(2):109--176, 1997. Google Scholar
Digital Library
- A. P. Tolmach. Proc. 2nd TIC, 97--115, 1998. Google Scholar
Digital Library
- P. Wadler. Proc. 3rd ICFP, 63--74, 1998. Google Scholar
Digital Library
- P. Wadler and P. Thiemann. ACM Trans. Comp. Log., 4(1):1--32, 2003. Google Scholar
Digital Library
- A. K. Wright and M. Felleisen. Inf. Comp., 115(1):38--94, 1994. Google Scholar
Digital Library
Index Terms
Algebraic foundations for effect-dependent optimisations
Recommendations
Algebraic foundations for effect-dependent optimisations
POPL '12: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesWe present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebraic effects, a development of Moggi's monadic theory of computational ...
Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions
Alex Simpson has suggested to use an observationally-induced approach towards modelling computational effects in denotational semantics. The principal idea is that a single observation algebra is used for defining the computational type structure. He ...
Observationally-induced Effects in Cartesian Closed Categories
Alex Simpson has suggested an observationally-induced approach towards obtaining monads for computational effects in denotational semantics. The underlying idea of this approach is to use a single observation algebra as computational prototype and to ...







Comments