Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Probabilistic non-determinism
ALGOL-like languages (v.2)
A representable approach to finite nondeterminism
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Call-by-Push-Value: A Subsuming Paradigm
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Adequacy for Algebraic Effects
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Composing monads using coproducts
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Possible World Semantics for General Storage in Call-By-Value
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Monadic augment and generalised short cut fusion
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Structured formal development in Isabelle
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Generic models for computational effects
Theoretical Computer Science - Logic, language, information and computation
Discrete Lawvere theories and computational effects
Theoretical Computer Science - Algebra and coalgebra in computer science
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining algebraic effects with continuations
Theoretical Computer Science
Free-algebra models for the π -calculus
Theoretical Computer Science
Tensors of Comodels and Models for Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Global State Considered Helpful
Electronic Notes in Theoretical Computer Science (ENTCS)
A model of cooperative threads
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 3rd workshop on Programming languages meets program verification
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Gabriel–ulmer duality and lawvere theories enriched over a general base
Journal of Functional Programming
Parameterised notions of computation
Journal of Functional Programming
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names
Electronic Notes in Theoretical Computer Science (ENTCS)
From Comodels to Coalgebras: State and Arrays
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects in Topological Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Monads and Adjunctions for Global Exceptions
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics for Local Computational Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
A principled approach to programming with nested types in Haskell
Higher-Order and Symbolic Computation
Comparing free algebras in Topological and Classical Domain Theory
Theoretical Computer Science
Adequacy for infinitary algebraic effects
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Algebras for parameterised monads
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A Nominal Relational Model for Local Store
Electronic Notes in Theoretical Computer Science (ENTCS)
Monad transformers as monoid transformers
Theoretical Computer Science
Just do it: simple monadic equational reasoning
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A counterexample to tensorability of effects
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Linearly-used state in models of call-by-value
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Towards Effects in Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Hennessy-Plotkin-Brookes revisited
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Algebraic foundations for effect-dependent optimisations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Reading, writing and relations: towards extensional semantics for effect analyses
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Monoidal indeterminates and categories of possible worlds
Theoretical Computer Science
Parameterised notions of computation
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Logic for computational effects: work in progress
IWFM'03 Proceedings of the 6th international conference on Formal Methods
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrency and the algebraic theory of effects
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
The sequential semantics of producer effect systems
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comodels and effects in mathematical operational semantics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
A coinductive calculus for asynchronous side-effecting processes
Information and Computation
Normalization by Evaluation and Algebraic Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
Observationally-induced Algebras in Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Instances of Computational Effects: An Algebraic Perspective
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Freyd categories are Enriched Lawvere Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We model notions of computation using algebraic operations and equations. We show that these generate several of the monads of primary interest that have been used to model computational effects, with the striking omission of the continuations monad. We focus on semantics for global and local state, showing that taking operations and equations as primitive yields a mathematical relationship that reflects their computational relationship.