{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:15:11Z","timestamp":1767928511581,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005304","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE25-0011, ANR-14-CE25-0005"],"award-info":[{"award-number":["ANR-16-CE25-0011, ANR-14-CE25-0005"]}],"id":[{"id":"10.13039\/501100005304","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209149","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T12:14:43Z","timestamp":1530101683000},"page":"452-461","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Quantitative Behavioural Reasoning for Higher-order Effectful Programs"],"prefix":"10.1145","author":[{"given":"Francesco","family":"Gavazzo","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA Sophia Antipolis, Bologna, Italy"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"S. Abramsky. 1990. The Lazy Lambda Calculus. (1990) 65--117. S. Abramsky. 1990. The Lazy Lambda Calculus. (1990) 65--117."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"S. Abramsky and A. Jung. 1994. Domain Theory. In Handbook of Logic in Computer Science. Clarendon Press 1--168. S. Abramsky and A. Jung. 1994. Domain Theory. In Handbook of Logic in Computer Science. Clarendon Press 1--168.","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90045-6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060439"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"P. Cl\u00e9ment and W. Desch. 2008. Wasserstein metric and subordination. (2008). P. Cl\u00e9ment and W. Desch. 2008. Wasserstein metric and subordination. (2008).","DOI":"10.4064\/sm189-1-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_12"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.64"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of ESOP","author":"Crubill\u00e9 R.","year":"2017","unstructured":"R. Crubill\u00e9 and U. Dal Lago . 2017. Metric Reasoning About \u03bb-Terms: The General Case . In Proc. of ESOP 2017 . 341--367. R. Crubill\u00e9 and U. Dal Lago. 2017. Metric Reasoning About \u03bb-Terms: The General Case. In Proc. of ESOP 2017. 341--367."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of LICS","author":"Dal Lago U.","year":"2017","unstructured":"U. Dal Lago , F. Gavazzo , and P.B. Levy . 2017. Effectful applicative bisimilarity: Monads, relators, and Howe's method . In Proc. of LICS 2017 . 1--12. U. Dal Lago, F. Gavazzo, and P.B. Levy. 2017. Effectful applicative bisimilarity: Monads, relators, and Howe's method. In Proc. of LICS 2017. 1--12."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535872"},{"key":"e_1_3_2_1_11_1","unstructured":"B.A. Davey and H.A. Priestley. 1990. Introduction to lattices and order. Cambridge University Press. B.A. Davey and H.A. Priestley. 1990. Introduction to lattices and order. Cambridge University Press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009890"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802188"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of SETTA","author":"Du W.","year":"2016","unstructured":"W. Du , Y. Deng , and D. Gebler . 2016. Behavioural Pseudometrics for Nondeterministic Probabilistic Systems . In Proc. of SETTA 2016 . 67--84. W. Du, Y. Deng, and D. Gebler. 2016. Behavioural Pseudometrics for Nondeterministic Probabilistic Systems. In Proc. of SETTA 2016. 67--84."},{"key":"e_1_3_2_1_15_1","volume-title":"Workshop on Realizability Semantics and Applications.","author":"Escardo M.H.","year":"1999","unstructured":"M.H. Escardo . 1999 . A metric model of PCF . In Workshop on Realizability Semantics and Applications. M.H. Escardo. 1999. A metric model of PCF. In Workshop on Realizability Semantics and Applications."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"F. Gavazzo. 2018. Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (Long Version). https:\/\/arxiv.org\/abs\/1801.09072 F. Gavazzo. 2018. Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances (Long Version). https:\/\/arxiv.org\/abs\/1801.09072","DOI":"10.1145\/3209108.3209149"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"D. Gebler Larsen. K.G. and S. Tini. 2016. Compositional bisimulation metric reasoning with Probabilistic Process Calculi. LMCS 12 4 (2016). D. Gebler Larsen. K.G. and S. Tini. 2016. Compositional bisimulation metric reasoning with Probabilistic Process Calculi. LMCS 12 4 (2016).","DOI":"10.2168\/LMCS-12(4:12)2016"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90386-T"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"D. Hofmann G.J. Seal and W. Tholen (Eds.). 2014. Monoidal Topology. A Categorical Approach to Order Metric and Topology. Number 153 in Encyclopedia of Mathematics and its Applications. Cambridge University Press. D. Hofmann G.J. Seal and W. Tholen (Eds.). 2014. Monoidal Topology. A Categorical Approach to Order Metric and Topology. Number 153 in Encyclopedia of Mathematics and its Applications. Cambridge University Press.","DOI":"10.1017\/CBO9781107517288"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01304852"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0139-P"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2015.08.002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02924844"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00088-9"},{"key":"e_1_3_2_1_27_1","volume-title":"Categories for the Working Mathematician","author":"MacLane S.","unstructured":"S. MacLane . 1971. Categories for the Working Mathematician . Springer-Verlag . S. MacLane. 1971. Categories for the Working Mathematician. Springer-Verlag."},{"key":"e_1_3_2_1_29_1","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"Pitts A.M.","unstructured":"A.M. Pitts . 2011. Howe's Method for Higher-Order Languages . In Advanced Topics in Bisimulation and Coinduction , D. Sangiorgi and J. Rutten (Eds.). Cambridge University Press , 197--232. A.M. Pitts. 2011. Howe's Method for Higher-Order Languages. In Advanced Topics in Bisimulation and Coinduction, D. Sangiorgi and J. Rutten (Eds.). Cambridge University Press, 197--232."},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of FOSSACS","author":"Plotkin G.D.","year":"2001","unstructured":"G.D. Plotkin and J. Power . 2001. Adequacy for Algebraic Effects . In Proc. of FOSSACS 2001 . 1--24. G.D. Plotkin and J. Power. 2001. Adequacy for Algebraic Effects. In Proc. of FOSSACS 2001. 1--24."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863568"},{"key":"e_1_3_2_1_32_1","volume-title":"Abstraction and Parametric Polymorphism. In IFIP Congress. 513--523","author":"Reynolds J.C.","year":"1983","unstructured":"J.C. Reynolds . 1983 . Types , Abstraction and Parametric Polymorphism. In IFIP Congress. 513--523 . J.C. Reynolds. 1983. Types, Abstraction and Parametric Polymorphism. In IFIP Congress. 513--523."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00013-5"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890002"},{"key":"e_1_3_2_1_35_1","volume-title":"Proc. of ESOP","author":"Simpson A.","year":"2018","unstructured":"A. Simpson and N. Voorneveld . 2018. Behavioural equivalence via modalities for algebraic effects . In Proc. of ESOP 2018 . A. Simpson and N. Voorneveld. 2018. Behavioural equivalence via modalities for algebraic effects. In Proc. of ESOP 2018."},{"key":"e_1_3_2_1_36_1","unstructured":"L.A. Steen and J.A. Seebach. 1995. Counterexamples in Topology. Dover Publications. L.A. Steen and J.A. Seebach. 1995. Counterexamples in Topology. Dover Publications."},{"key":"e_1_3_2_1_37_1","unstructured":"A.M. Thijs. 1996. Simulation and fixpoint semantics. Rijksuniversiteit Groningen. A.M. Thijs. 1996. Simulation and fixpoint semantics. Rijksuniversiteit Groningen."},{"key":"e_1_3_2_1_38_1","volume-title":"Optimal Transport: Old and New","author":"Villani C.","year":"2008","unstructured":"C. Villani . 2008 . Optimal Transport: Old and New . Springer Berlin Heidelberg . C. Villani. 2008. Optimal Transport: Old and New. Springer Berlin Heidelberg."}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209149","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:07Z","timestamp":1750212427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209149"}},"subtitle":["Applicative Distances"],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":36,"alternative-id":["10.1145\/3209108.3209149","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209149","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}