A logic for algebraic effects

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 118-129

  Plotkin, Gordon ^a   Pretnar, Matija ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC EFFECTS; CALL-BY-PUSH-VALUE; LOGIC IN COMPUTER SCIENCE;

ALGEBRA; COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; DIFFERENTIATION (CALCULUS); MATHEMATICAL TECHNIQUES;

CALCULATIONS;

EID: 51549091252     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.45     Document Type: Conference Paper

References (30)

1. N. Benton and A. Kennedy. Exceptional syntax. J. Fun. Prog., 11(4):395-410, 2001.
2. F. Borceux. Handbook of Categorical Algebra. Cambridge University Press. 1994.
3. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In PLDI, pages 237-247, 1993.
4. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Form. Asp. of Comp., 13:341-363, 2001.
5. S. Goncharov, L. Schröder, and T. Mossakowski. Completeness of global evaluation logic. In 31st MFPS, pages 447-458, 2006.
6. M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF. Springer, 1979.
7. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. ACM, 32(1):137-161, 1985.
8. C. A. R. Hoare. An axiomatic basis for computer programming. Comm. ACM, 12(10):576-580, 1969.
9. M. Hyland, P. B. Levy, G. D. Plotkin, and A. J. Power. Combining algebraic effects with continuations. Theor. Comp. Sci., 375(1-3):20-40, 2007.
10. M. Hyland, G. D. Plotkin, and A. J. Power. Combining effects: Sum and tensor. Theor. Comp. Sci., 357(1-3):70-99, 2006.
11. M. Hyland and A. J. Power. Discrete Lawvere theories and computational effects. Theor. Comp. Sci., 366(1-2):144-162, 2006.
12. P. B. Levy. Call-by-push-value: Decomposing call-by-value and call-by-name. High. Ord. Symb. Comp., 19(4):377-414, 2006.
13. P. B. Levy. Monads and adjunctions for global exceptions. Elect. Notes Theor. Comp. Sci., 158:261-287, 2006.
14. E. Moggi. Notions of computation and monads. Inform. Comp., 93(1):55-92, 1991.
15. E. Moggi. A general semantics for evaluation logic. In 9th LICS, pages 353-362, 1994.
16. E. Moggi. A semantics for evaluation logic. Fund. Inform., 22(1/2):117-152, 1995.
17. A. M. Pitts. Evaluation logic. In 4th HOW, pages 162-189, 1991.
18. G. D. Plotkin. Some varieties of equational logic. In Essays Dedicated to Joseph A. Goguen, pages 150-156, 2006.
19. G. D. Plotkin and A. J. Power. Adequacy for algebraic effects. In 4th FoSSaCS, pages 1-24, 2001.
20. G. D. Plotkin and A. J. Power. Notions of computation determine monads. In 5th FoSSaCS, pages 342-356, 2002.
21. G. D. Plotkin and A. J. Power. Algebraic operations and generic effects. Appl. Cat. Struct., 11(1):69-94, 2003.
22. G. D. Plotkin and A. J. Power. Logic for computational effects: Work in progress. In 6th IWFM, 2003.
23. G. D. Plotkin and A. J. Power. Computational effects and operations: An overview. Elect. Notes Theor. Comp. Sci., 73:149-163, 2004.
24. G. D. Plotkin and A. J. Power. Tensors of comodels and models for operational semantics. In 24th MFPS, 2008. To appear.
25. A. Pnueli. The temporal logic of programs. In 18th FoCS, pages 46-57, 1977.
26. A. J. Power. Countable Lawvere theories and computational effects. Elect. Notes Theor. Comp. Sci., 161:59-71, 2006.
27. A. J. Power and O. Shkaravska. From comodels to coalgebras: State and arrays. Elect. Notes Theor. Comp. Sci., 106:297-314, 2004.
28. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In 17th LICS, pages 55-74, 2002.
29. L. Schroder and T. Mossakowski. Monad-independent dynamic logic in HasCasl. J. Log. and Comp., 14(4):571-619, 2004.
30. D. S. Scott. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theor. Comp. Sci., 121(1-2):411-440, 1993.