Notions of computation and monads
Information and Computation
Algebraic theories for name-passing calculi
Information and Computation
ALGOL-like languages (v.2)
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Modelling environments in call-by-value programming languages
Information and Computation
Journal of Functional Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Full abstraction for nominal general references
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Free-algebra models for the π -calculus
Theoretical Computer Science
Term Equational Systems and Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Logic and Computation
Presenting functors on many-sorted varieties and applications
Information and Computation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Segal Condition Meets Computational Effects
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Just do it: simple monadic equational reasoning
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Stone duality for nominal Boolean algebras with И
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
Algebraic foundations for effect-dependent optimisations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enumerative Combinatorics: Volume 1
Enumerative Combinatorics: Volume 1
Structural recursion with locally scoped names
Journal of Functional Programming
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
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
Freyd categories are Enriched Lawvere Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We investigate the connections between computational effects, algebraic theories, and monads on functor categories. We develop a syntactic framework with variable binding that allows us to describe equations between programs while taking into account the idea that there may be different instances of a particular computational effect. We use our framework to give a general account of several notions of computation that had previously been analyzed in terms of monads on presheaf categories: the analysis of local store by Plotkin and Power; the analysis of restriction by Pitts; and the analysis of the pi calculus by Stark.