{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:11Z","timestamp":1772164031591,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,1,8]]},"DOI":"10.1145\/2535838.2535881","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"361-372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Fair reactive programming"],"prefix":"10.1145","author":[{"given":"Andrew","family":"Cave","sequence":"first","affiliation":[{"name":"McGill University, Montreal, PQ, Canada"}]},{"given":"Francisco","family":"Ferreira","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, PQ, Canada"}]},{"given":"Prakash","family":"Panangaden","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, PQ, Canada"}]},{"given":"Brigitte","family":"Pientka","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, PQ, Canada"}]}],"member":"320","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"21","volume-title":"TYPES","author":"Abel A.","year":"1999"},{"key":"e_1_3_2_2_2_1","unstructured":"T. Altenkirch. Constructions Inductive Types and Strong Normalization. PhD thesis University of Edinburgh November 1993.  T. Altenkirch. Constructions Inductive Types and Strong Normalization. PhD thesis University of Edinburgh November 1993."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646723.702721"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.16"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"L. Birkedal A. Bizjak and J. Schwinghammer. Step-indexed relational reasoning for countable nondeterminism. Submitted journal version of CSL'11 paper 2013.  L. Birkedal A. Bizjak and J. Schwinghammer. Step-indexed relational reasoning for countable nondeterminism. Submitted journal version of CSL'11 paper 2013.","DOI":"10.2168\/LMCS-9(4:4)2013"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41641"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_20"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645771.667929"},{"key":"e_1_3_2_2_9_1","unstructured":"J. Donham. Functional reactive programming in OCaml. URL https:\/\/github.com\/jaked\/froc.  J. Donham. Functional reactive programming in OCaml. URL https:\/\/github.com\/jaked\/froc."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258973"},{"key":"e_1_3_2_2_11_1","first-page":"7","article-title":"Interpr\u00e9tation fonctionnelle et elimination des coupures de l'arithmtique d'ordre sup\u00e9rieur. These d'\u00e9tat","author":"Girard J. Y.","year":"1972","journal-title":"Universit\u00e9 de Paris"},{"key":"e_1_3_2_2_12_1","volume-title":"Cambridge University Press","author":"Girard J.-Y.","year":"1990"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/788022.789002"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103776.2103783"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2428116.2428127"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500584"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2012.08.015"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2428116.2428128"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00161-2"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.09.008"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500588"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.38"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103665"},{"key":"e_1_3_2_2_25_1","unstructured":"O. Lichtenstein. Decidability Completeness and Extensions of Linear Time Temporal Logic. PhD thesis TheWeizmann Institute of Science 1991.  O. Lichtenstein. Decidability Completeness and Extensions of Linear Time Temporal Logic. PhD thesis TheWeizmann Institute of Science 1991."},{"key":"e_1_3_2_2_26_1","volume-title":"University of Edinburgh","author":"Luo Z.","year":"1990"},{"key":"e_1_3_2_2_27_1","volume-title":"University of Munich","author":"Matthes R.","year":"1998"},{"key":"e_1_3_2_2_28_1","volume-title":"Cornell University","author":"Mendler N. P.","year":"1988"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/581690.581695"},{"key":"e_1_3_2_2_30_1","first-page":"167","volume-title":"Proceedings of the 5th GI-Conference, Lecture Notes in Computer Science (LNCS 104","author":"Park D. M. R.","year":"1981"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_2_32_1","volume-title":"LRI","author":"Pouzet M.","year":"2006"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398856.2364550"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.2307\/2271658"}],"event":{"name":"POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Diego California USA","acronym":"POPL '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535881","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535838.2535881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:06Z","timestamp":1750219806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":34,"alternative-id":["10.1145\/2535838.2535881","10.1145\/2535838"],"URL":"https:\/\/doi.org\/10.1145\/2535838.2535881","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578855.2535881","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,1,8]]},"assertion":[{"value":"2014-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}