Notions of Computation Determine Monads (2002)

Cached

Download Links

by Gordon Plotkin , John Power
Venue:Proc. FOSSACS 2002, Lecture Notes in Computer Science 2303
Citations:54 - 7 self

Active Bibliography

19 Combining Computational Effects: Commutativity and Sum – Martin Hyland, Gordon Plotkin, John Power - 2002
32 Algebraic Operations and Generic Effects – Gordon Plotkin, John Power - 2003
10 Semantics for Algebraic Operations – Gordon Plotkin, John Power - 2001
10 Countable Lawvere Theories and Computational Effects – John Power - 2006
29 Combining effects: sum and tensor – Martin Hyland, Gordon Plotkin, John Power
30 Adequacy for algebraic effects – Gordon Plotkin, Matija Pretnar - 2001
26 Computational Effects and Operations: An Overview – Gordon Plotkin, John Power - 2004
Semantics of Binary Choice Constructs – Reinhold Heckmann, Dr. Reinhold Heckmann, Probabilistic Power Domains, Information Systems
12 The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads – Martin Hyland, John Power - 2007
4 Semantics for Local Computational Effects – John Power - 2006
13 A Convenient Category of Domains – Ingo Battenfeld, Matthias Schröder, Alex Simpson
5 Generic Models for Computational Effects – John Power
Presheaf models for the π-calculus – Ian Stark - 1997
2 Some Varieties of Equational Logic (Extended Abstract), Algebra – Gordon Plotkin - 2006
2 Axiomatics for Data Refinement in Call By Value Programming Languages – John Power, Miki Tanaka
Logical Relations for Dynamic . . . – Yu Zhang, David Nowak - 2003
12 Full abstraction for nominal general references – Nikos Tzevelekos
45 Presheaf Models for Concurrency – Gian Luca Cattani - 1999
3 Power Domains Supporting Recursion and Failure – Reinhold Heckmann, Bundesrepublik Deutschland - 1998