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
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Handbook of logic in computer science (vol. 3)
A representable approach to finite nondeterminism
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Algebraic Semantics
Call-by-Value and Nondeterminism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Call-by-Push-Value: A Subsuming Paradigm
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Closed Freyd- and kappa-categories
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Modular Approach to Denotational Semantics
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Nondeterminism and Probabilistic Choice: Obeying the Laws
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Computational Adequacy in an Elementary Topos
Proceedings of the 12th International Workshop on Computer Science Logic
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for Finite Nondeterminism
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
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
Kleisli category and database mappings
International Journal of Intelligent Information and Database Systems
Towards Effects in Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic foundations for effect-dependent optimisations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Explicit fair scheduling for dynamic control
Concurrency, Compositionality, and Correctness
Logic for computational effects: work in progress
IWFM'03 Proceedings of the 6th international conference on Formal Methods
Comodels and effects in mathematical operational semantics
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
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
| Hi-index | 0.00 |
Moggi proposed a monadic account of computational effects. He also presented the computational λ-calculus, λc, a core call-by-value functional programming language for effects; the effects are obtained by adding appropriate operations. The question arises as to whether one can give a corresponding treatment of operational semantics. We do this in the case of algebraic effects where the operations are given by a single-sorted algebraic signature, and their semantics is supported by the monad, in a certain sense. We consider call-by-value PCF with-- and without--recursion, an extension of λc with arithmetic. We prove general adequacy theorems, and illustrate these with two examples: nondeterminism and probabilistic nondeterminism.