{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:02:33Z","timestamp":1751774553227,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1420175, 1545197"],"award-info":[{"award-number":["1420175, 1545197"]}],"id":[{"id":"10.13039\/100000001","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.3209141","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T12:14:43Z","timestamp":1530101683000},"page":"869-878","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A General Framework for Relational Parametricity"],"prefix":"10.1145","author":[{"given":"Kristina","family":"Sojakova","sequence":"first","affiliation":[{"name":"Appalachian State University, Boone, NC, USA"}]},{"given":"Patricia","family":"Johann","sequence":"additional","affiliation":[{"name":"Appalachian State University, Boone, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535852"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021860"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"N. Ghani F. Nordvall Forsberg and F. Orsanigo. 2016. Proof-Relevant Parametricity. In A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday (Lecture Notes in Computer Science 9600). 109--131. N. Ghani F. Nordvall Forsberg and F. Orsanigo. 2016. Proof-Relevant Parametricity. In A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday (Lecture Notes in Computer Science 9600). 109--131.","DOI":"10.1007\/978-3-319-30936-1_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"N. Ghani F. Nordvall Forsberg and A. Simpson. 2016. Comprehensive Parametric Polymorphism: Categorical Models and Type Theory. In Foundations of Software Science and Computation Structures. 3--19. N. Ghani F. Nordvall Forsberg and A. Simpson. 2016. Comprehensive Parametric Polymorphism: Categorical Models and Type Theory. In Foundations of Software Science and Computation Structures. 3--19.","DOI":"10.1007\/978-3-662-49630-5_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2015.12.011"},{"key":"e_1_3_2_1_6_1","unstructured":"J.-Y. Girard P. Taylor and Y. Lafont. 1989. Proofs and Types. Cambridge University Press. J.-Y. Girard P. Taylor and Y. Lafont. 1989. Proofs and Types. Cambridge University Press."},{"volume-title":"Categorical Logic and Type Theory","author":"Jacobs B.","key":"e_1_3_2_1_7_1","unstructured":"B. Jacobs . 1999. Categorical Logic and Type Theory . Elsevier . B. Jacobs. 1999. Categorical Logic and Type Theory. Elsevier."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001298"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Q. Ma and J. Reynolds. 1992. Types Abstraction and Parametric Polymorphism. In Mathematical Foundations of Program Semantics. 1--40. Q. Ma and J. Reynolds. 1992. Types Abstraction and Parametric Polymorphism. In Mathematical Foundations of Program Semantics. 1--40.","DOI":"10.1007\/3-540-55511-0_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/210346.210425"},{"key":"e_1_3_2_1_11_1","unstructured":"F. Orsanigo. 2017. Bifibrational Parametricity: From Zero to Two Dimensions. Ph.D. Dissertation. University of Strathclyde. F. Orsanigo. 2017. Bifibrational Parametricity: From Zero to Two Dimensions. Ph.D. Dissertation. University of Strathclyde."},{"key":"e_1_3_2_1_12_1","unstructured":"J. Reynolds. 1983. Types Abstraction and Parametric Polymorphism. In International Federation for Information Processing. 513--523. J. Reynolds. 1983. Types Abstraction and Parametric Polymorphism. In International Federation for Information Processing. 513--523."},{"key":"e_1_3_2_1_13_1","volume-title":"Polymorphism is not set-theoretic. Semantics of Data Types","author":"Reynolds J. C.","year":"1984","unstructured":"J. C. Reynolds . 1984. Polymorphism is not set-theoretic. Semantics of Data Types ( 1984 ), 145--156. J. C. Reynolds. 1984. Polymorphism is not set-theoretic. Semantics of Data Types (1984), 145--156."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"E. Robinson and G. Rosolini. 1994. Reflexive Graphs and Parametric Polymorphism. In Logic in Computer Science. 364--371. E. Robinson and G. Rosolini. 1994. Reflexive Graphs and Parametric Polymorphism. In Logic in Computer Science. 364--371.","DOI":"10.1109\/LICS.1994.316053"},{"key":"e_1_3_2_1_15_1","volume-title":"Categorical Semantics for Higher Order Polymorphic Lambda Calculus. Journal of Symbolic Logic 52","author":"Seely R. A. G.","year":"1987","unstructured":"R. A. G. Seely . 1987. Categorical Semantics for Higher Order Polymorphic Lambda Calculus. Journal of Symbolic Logic 52 ( 1987 ), 969--989. R. A. G. Seely. 1987. Categorical Semantics for Higher Order Polymorphic Lambda Calculus. Journal of Symbolic Logic 52 (1987), 969--989."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Oxford United Kingdom","acronym":"LICS '18"},"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.3209141","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209141","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T11:05:51Z","timestamp":1751713551000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":16,"alternative-id":["10.1145\/3209108.3209141","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209141","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"}}]}}