Samson Abramsky (1990):
The lazy λ-calculus.
Research Topics in Functional Programming,
pp. 65–117.
André Arnold & Maurice Nivat (1980):
Metric interpretations of infinite trees and semantics of non deterministic recursive programs.
Theoretical Computer Science 11(2),
pp. 181 – 205,
doi:10.1016/0304-3975(80)90045-6.
Ingo Battenfeld, Klaus Keimel & Thomas Streicher (2014):
Observationally-induced Algebras in Domain Theory.
Logical Methods in Computer Science 10(3:18),
pp. 1–26,
doi:10.2168/lmcs-10(3:18)2014.
Ugo Dal Lago & Francesco Gavazzo (2019):
Effectful Normal Form Bisimulation.
In: Programming Languages and Systems.
Springer International Publishing,
pp. 263–292,
doi:10.1007/978-3-030-17184-1_10.
Ugo Dal Lago, Francesco Gavazzo & Paul B. Levy (2017):
Effectful Applicative Bisimilarity: Monads, Relators, and the Howe’s Method.
Logic in Computer Science,
pp. 1–12,
doi:10.1109/lics.2017.8005117.
Martín Escardó (2009):
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting.
Electronic Notes in Theoretical Computer Science 249,
pp. 219 – 242,
doi:10.1016/j.entcs.2009.07.092.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009).
Martín Hötzel Escardó (1999):
A metric model of PCF.
In: Workshop on Realizability Semantics and Applications..
Marcelo Fiore & Sam Staton (2014):
Substitution, Jumps, and Algebraic Effects.
In: Proceedings of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
CSL-LICS '14,
pp. 41:1–41:10,
doi:10.1145/2603088.2603163.
Francesco Gavazzo (2018):
Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018,
pp. 452–461,
doi:10.1145/3209108.3209149.
Ichiro Hasuo (2015):
Generic Weakest Precondition Semantics from Monads Enriched with Order.
Theoretical Computer Science 604(C),
pp. 2–29,
doi:10.1016/j.tcs.2015.03.047.
Patricia Johann, Alex Simpson & Janis Voigtländer (2010):
A Generic Operational Metatheory for Algebraic Effects.
In: Proceedings of Logic in Computer Science (LICS'10),
pp. 209–218,
doi:10.1109/lics.2010.29.
Paul Blain Levy (2011):
Similarity Quotients as Final Coalgebras.
In: Foundations of Software Science and Computational Structures.
Springer Berlin Heidelberg,
pp. 27–41,
doi:10.1007/978-3-642-19805-2_3.
Aliaume Lopez & Alex Simpson (2018):
Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular.
In: 27th EACSL Annual Conference on Computer Science Logic, CSL 2018,
pp. 29:1–29:17,
doi:10.4230/LIPIcs.CSL.2018.29.
Radu Mardare, Prakash Panangaden & Gordon D. Plotkin (2016):
Quantitative Algebraic Reasoning.
In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16,
pp. 700–709,
doi:10.1145/2933575.2934518.
Cristina Matache & Sam Staton (2019):
A Sound and Complete Logic for Algebraic Effects.
In: Lecture Notes in Computer Science.
Springer International Publishing,
pp. 382–399,
doi:10.1007/978-3-030-17127-8_22.
Gordon D. Plotkin (1983):
Domains.
Course notes.
Gordon D. Plotkin & John Power (2001):
Adequacy for Algebraic Effects.
Foundations of Software Science and Computation Structures,
pp. 1–24,
doi:10.1007/3-540-45315-6_1.
Gordon D. Plotkin & John Power (2002):
Notions of Computation Determine Monads.
In: Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures,
pp. 342–356,
doi:10.1007/3-540-45931-6_24.
Gordon D. Plotkin & John Power (2003):
Algebraic Operations and Generic Effects.
Applied Categorical Structures 11,
pp. 69–94,
doi:10.1023/A:1023064908962.
Gordon D. Plotkin & John Power (2004):
Computational Effects and Operations: An Overview.
Electronic Notes in Theoretical Computer Science 73,
pp. 149–163,
doi:10.1016/j.entcs.2004.08.008.
Davide Sangiorgi (2011):
Introduction to Bisimulation and Coinduction.
Cambridge University Press,
Cambridge, UK,
doi:10.1017/cbo9780511777110.
Davide Sangiorgi & Jan Rutten (2011):
Advanced Topics in Bisimulation and Coinduction.
Cambridge Tracts in Theoretical Computer Science.
Cambridge University Press,
Cambridge, UK,
doi:10.1017/CBO9780511792588.
Alex Simpson & Niels Voorneveld (2018):
Behavioural Equivalence via Modalities for Algebraic Effects.
In: Programming Languages and Systems (ESOP 2018),
pp. 300–326,
doi:10.1007/978-3-319-89884-1_11.
Alex Simpson & Niels Voorneveld (2020):
Behavioural Equivalence via Modalities for Algebraic Effects.
ACM Trans. Program. Lang. Syst. 42,
doi:10.1145/3363518.
45 pages.
Niels Voorneveld (2019):
Quantitative Logics for Equivalence of Effectful Programs 347,
pp. 281 – 301,
doi:10.1016/j.entcs.2019.09.015.
Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics.
eptcs@eptcs.org