Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. A representable approach to finite nondeterminism;Anderson;Theoretical Computer Science,1997
2. Compiling with Continuations;Appel,1992
3. Bucalo A., C. Führmann and A. Simpson, Equational lifting monads, Available from http://www.dcs.ed.ac.uk/home/car/research.htm (1999), submitted.
4. Führmann C., Relating two models of continuations, Available from http://www.dcs.ed.ac.uk/home/car/research.htm (1998).
5. Hasegawa M., Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi, in: Proc. 6th International Conference on Category Theory and Computer Science (CTCS'95), LNCS 1210 (1997).
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Concurrent monads for shared state;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
2. Galois connecting call-by-value and call-by-name;Logical Methods in Computer Science;2024-02-12
3. Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. Representable Markov categories and comparison of statistical experiments in categorical probability;Theoretical Computer Science;2023-06
5. Probability monads with submonads of deterministic states;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02