{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:50Z","timestamp":1750307210530,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,28]],"date-time":"2012-01-28T00:00:00Z","timestamp":1327708800000},"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":[[2012,1,28]]},"DOI":"10.1145\/2103786.2103788","type":"proceedings-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T14:49:33Z","timestamp":1328021373000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Towards concurrent type theory"],"prefix":"10.1145","author":[{"given":"Lu\u00eds","family":"Caires","sequence":"first","affiliation":[{"name":"Universidade Nova de Lisboa, Lisbon, Portugal"}]},{"given":"Frank","family":"Pfenning","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Bernardo","family":"Toninho","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University & Universidade Nove de Lisboa, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,1,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360213"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90181-R"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.3.297"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.4.447"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887654.1887670"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2266170"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1936-1501858-0"},{"key":"e_1_3_2_1_10_1","volume-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"Constable R. L.","year":"1986","unstructured":"R. L. Constable Implementing Mathematics with the Nuprl Proof Development System . Prentice-Hall , Englewood Cliffs , New Jersey, 1986 . R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs, New Jersey, 1986."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.20.11.584"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_19"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/conm\/092\/1003197","volume-title":"Categories in Computer Science and Logic","author":"Girard J.-Y.","year":"1989","unstructured":"J.-Y. Girard . Towards a geometry of interaction. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic , pages 69 -- 108 . American Mathematical Society , 1989 . Contemporary Mathematics, Volume 92 . J.-Y. Girard. Towards a geometry of interaction. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic, pages 69--108. American Mathematical Society, 1989. Contemporary Mathematics, Volume 92."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646728.703349"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645392.651876"},{"key":"e_1_3_2_1_17_1","volume-title":"Unpublished note. An annotated version appeared in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 479--490","author":"Howard W. A.","year":"1980","unstructured":"W. A. Howard . The formulae-as-types notion of construction. Unpublished note. An annotated version appeared in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 479--490 , Academic Press ( 1980 ), 1969. W. A. Howard. The formulae-as-types notion of construction. Unpublished note. An annotated version appeared in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 479--490, Academic Press (1980), 1969."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224189"},{"key":"e_1_3_2_1_19_1","first-page":"153","volume-title":"Methodology and Philosophy of Science VI","author":"Martin-L\u00f6f P.","year":"1980","unstructured":"P. Martin-L\u00f6f . Constructive mathematics and computer programming. In Logic , Methodology and Philosophy of Science VI , pages 153 -- 175 . North-Holland , 1980 . P. Martin-L\u00f6f. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science VI, pages 153--175. North-Holland, 1980."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004323"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001407"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"e_1_3_2_1_23_1","volume-title":"Oct.","author":"P\u00e9rez J. A.","year":"2011","unstructured":"J. A. P\u00e9rez , L. Caires , F. Pfenning , and B. Toninho . Termination in sessionbased concurrency via linear logical relations . Submitted, Oct. 2011 . J. A. P\u00e9rez, L. Caires, F. Pfenning, and B. Toninho. Termination in sessionbased concurrency via linear logical relations. Submitted, Oct. 2011."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25379-9_4"},{"key":"e_1_3_2_1_25_1","unstructured":"D. Prawitz. Natural Deduction. Almquist & Wiksell Stockholm 1965.  D. Prawitz. Natural Deduction. Almquist & Wiksell Stockholm 1965."},{"key":"e_1_3_2_1_27_1","volume-title":"The \u03c0-Calculus: A Theory of Mobile Processes","author":"Sangiorgi D.","year":"2001","unstructured":"D. Sangiorgi and D. Walker . The \u03c0-Calculus: A Theory of Mobile Processes . Cambridge University Press , 2001 . D. Sangiorgi and D. Walker. The \u03c0-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2003476.2003499"}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Philadelphia Pennsylvania USA","acronym":"POPL '12"},"container-title":["Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103786.2103788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103786.2103788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:35Z","timestamp":1750241195000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103786.2103788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,28]]},"references-count":25,"alternative-id":["10.1145\/2103786.2103788","10.1145\/2103786"],"URL":"https:\/\/doi.org\/10.1145\/2103786.2103788","relation":{},"subject":[],"published":{"date-parts":[[2012,1,28]]},"assertion":[{"value":"2012-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}