{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T10:23:36Z","timestamp":1791109416381,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T00:00:00Z","timestamp":1285545600000},"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":[[2010,9,27]]},"DOI":"10.1145\/1863543.1863561","type":"proceedings-article","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T13:41:50Z","timestamp":1285681310000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Logical types for untyped languages"],"prefix":"10.1145","author":[{"given":"Sam","family":"Tobin-Hochstadt","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,9,27]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.177847"},{"key":"e_1_3_2_2_2_1","series-title":"EATCS Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development","author":"Bertot Y.","year":"2004","unstructured":"}} Y. Bertot and P. Cast\u00e9ran . Interactive Theorem Proving and Program Development , volume XXV of EATCS Texts in Theoretical Computer Science . Springer-Verlag , 2004 . }}Y. Bertot and P. Cast\u00e9ran. Interactive Theorem Proving and Program Development, volume XXV of EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2004."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863560"},{"key":"e_1_3_2_2_4_1","first-page":"228","volume-title":"International Conference on Automata, Languages and Programming","author":"Cartwright R.","year":"1976","unstructured":"}} R. Cartwright . User-defined data types as an aid to verifying LISP programs . In International Conference on Automata, Languages and Programming , pages 228 -- 256 , 1976 . }}R. Cartwright. User-defined data types as an aid to verifying LISP programs. In International Conference on Automata, Languages and Programming, pages 228--256, 1976."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289459"},{"key":"e_1_3_2_2_6_1","volume-title":"Combinatory Logic","author":"Curry H.","year":"1958","unstructured":"}} H. Curry and R. Feys . Combinatory Logic , volume I . North-Holland , 1958 . }}H. Curry and R. Feys. Combinatory Logic, volume I. North-Holland, 1958."},{"key":"e_1_3_2_2_7_1","volume-title":"ECMAScript Edition 4 group wiki","author":"ECMA.","year":"2007","unstructured":"}} ECMA. ECMAScript Edition 4 group wiki , 2007 . URL http:\/\/wiki.ecmascript.org\/. }}ECMA. ECMAScript Edition 4 group wiki, 2007. URL http:\/\/wiki.ecmascript.org\/."},{"key":"e_1_3_2_2_8_1","volume-title":"How to Design Programs","author":"Felleisen M.","year":"2001","unstructured":"}} M. Felleisen , R. B. Findler , M. Flatt , and S. Krishnamurthi . How to Design Programs . MIT Press , 2001 . URL http:\/\/www.htdp.org\/. }}M. Felleisen, R. B. Findler, M. Flatt, and S. Krishnamurthi. How to Design Programs. MIT Press, 2001. URL http:\/\/www.htdp.org\/."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316703"},{"key":"e_1_3_2_2_10_1","volume-title":"Reference Manual PLT-TR2010-1. PLT Scheme","author":"Flatt M.","year":"2010","unstructured":"}} M. Flatt and P LT. Reference: Racket . Reference Manual PLT-TR2010-1. PLT Scheme , Inc . June 2010 . http:\/\/racket-lang.org\/techreports\/. }}M. Flatt and PLT. Reference: Racket. Reference Manual PLT-TR2010-1. PLT Scheme, Inc. June 2010. http:\/\/racket-lang.org\/techreports\/."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529700"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_14"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00004-2"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224203"},{"key":"e_1_3_2_2_15_1","first-page":"479","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism","author":"Howard W. A.","year":"1980","unstructured":"}} W. A. Howard . The formulas-as-types notion of construction . In J. P. Seldin and J. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , pages 479 -- 490 . Academic Press . 1980 . }}W. A. Howard. The formulas-as-types notion of construction. In J. P. Seldin and J. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, pages 479--490. Academic Press. 1980."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_11"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73564"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004829"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159811"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345100"},{"key":"e_1_3_2_2_22_1","first-page":"456","volume-title":"IFIP Congress (1)","author":"Reynolds J. C.","year":"1968","unstructured":"}} J. C. Reynolds . Automatic computation of data set definitions . In IFIP Congress (1) , pages 456 -- 461 , 1968 . }}J. C. Reynolds. Automatic computation of data set definitions. In IFIP Congress (1), pages 456--461, 1968."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180475.1180476"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96747"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328486"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1708016.1708023"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_1"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/239912.239917"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706343"}],"event":{"name":"ICFP '10: ACM SIGPLAN International Conference on Functional Programming","location":"Baltimore Maryland USA","acronym":"ICFP '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863543.1863561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1863543.1863561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:39:52Z","timestamp":1750232392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1863543.1863561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,27]]},"references-count":28,"alternative-id":["10.1145\/1863543.1863561","10.1145\/1863543"],"URL":"https:\/\/doi.org\/10.1145\/1863543.1863561","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1932681.1863561","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,9,27]]},"assertion":[{"value":"2010-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}