{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:23:56Z","timestamp":1781893436953,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,14]],"date-time":"2007-07-14T00:00:00Z","timestamp":1184371200000},"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":[[2007,7,14]]},"DOI":"10.1145\/1273920.1273951","type":"proceedings-article","created":{"date-parts":[[2012,10,10]],"date-time":"2012-10-10T14:45:29Z","timestamp":1349880329000},"page":"221-230","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Feasible reactivity in a synchronous \u03a0-calculus"],"prefix":"10.1145","author":[{"given":"Roberto M.","family":"Amadio","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Dabrowski","sequence":"additional","affiliation":[{"name":"INRIA Sophia Antipolis"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2006.08.001"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. Workshop on Algebraic Process Calculi: the first 25 years and beyond, Electronic Notes in Theoretical Computer Science, 162: 49--60","author":"Amadio R.","year":"2006","unstructured":"R. Amadio , G. Boudol , F. Boussinot and I. Castellani . Reactive programming, revisited . In Proc. Workshop on Algebraic Process Calculi: the first 25 years and beyond, Electronic Notes in Theoretical Computer Science, 162: 49--60 , 2006 . R. Amadio, G. Boudol, F. Boussinot and I. Castellani. Reactive programming, revisited. In Proc. Workshop on Algebraic Process Calculi: the first 25 years and beyond, Electronic Notes in Theoretical Computer Science, 162:49--60, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1227143.1227146"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.017"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.05.005"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201998"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(92)90005-V"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646802.705975"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.491649"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Logic, Methodology, and Philosophy of Science II","author":"Cobham A.","year":"1965","unstructured":"A. Cobham . The intrinsic computational difficulty of functions . In Proc. Logic, Methodology, and Philosophy of Science II , North Holland , 1965 . A. Cobham. The intrinsic computational difficulty of functions. In Proc. Logic, Methodology, and Philosophy of Science II, North Holland, 1965."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503297"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and complexity, from a programming perspective","author":"Jones N.","year":"1997","unstructured":"N. Jones . Computability and complexity, from a programming perspective . MIT-Press , 1997 . N. Jones. Computability and complexity, from a programming perspective. MIT-Press, 1997."},{"key":"e_1_3_2_1_14_1","volume-title":"Predicative recurrence and computational complexity i: word recurrence and poly-time. Feasible mathematics II","author":"Leivant D.","year":"1994","unstructured":"D. Leivant . Predicative recurrence and computational complexity i: word recurrence and poly-time. Feasible mathematics II , Clote and Remmel (eds.), Birkh\u00e4user :320--343, 1994 . D. Leivant. Predicative recurrence and computational complexity i: word recurrence and poly-time. Feasible mathematics II, Clote and Remmel (eds.), Birkh\u00e4user:320--343, 1994."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1069774.1069782"},{"key":"e_1_3_2_1_16_1","volume-title":"Communication and Concurrency","author":"Milner R.","year":"1989","unstructured":"R. Milner . Communication and Concurrency . Prentice-Hall , 1989 . R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"e_1_3_2_1_17_1","unstructured":"Reactive Programming INRIA Mimosa Project. http:\/\/www-sop.inria.fr\/mimosa\/rp.  Reactive Programming INRIA Mimosa Project. http:\/\/www-sop.inria.fr\/mimosa\/rp."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013963.1013986"}],"event":{"name":"PPDP07: Principles and Practice of Declarative Programming","location":"Wroclaw Poland","acronym":"PPDP07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273920.1273951","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273920.1273951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:10Z","timestamp":1750258690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273920.1273951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,14]]},"references-count":18,"alternative-id":["10.1145\/1273920.1273951","10.1145\/1273920"],"URL":"https:\/\/doi.org\/10.1145\/1273920.1273951","relation":{},"subject":[],"published":{"date-parts":[[2007,7,14]]},"assertion":[{"value":"2007-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}