{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:17Z","timestamp":1772163917781,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,1,12]],"date-time":"2005-01-12T00:00:00Z","timestamp":1105488000000},"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":[[2005,1,12]]},"DOI":"10.1145\/1040305.1040311","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T12:58:48Z","timestamp":1107089928000},"page":"63-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["A bisimulation for type abstraction and recursion"],"prefix":"10.1145","author":[{"given":"Eijiro","family":"Sumii","sequence":"first","affiliation":[{"name":"University of Pennsylvania"}]},{"given":"Benjamin C.","family":"Pierce","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}]}],"member":"320","published-online":{"date-parts":[[2005,1,12]]},"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.5555\/640050.640052"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/266420.266432"},{"key":"e_1_3_2_1_4_1","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"Abramsky S.","year":"1990","unstructured":"S. Abramsky . The lazy lambda calculus . In D. A. Turner, editor, Research Topics in Functional Programming , pages 65 -- 117 . Addison-Wesley , 1990 . S. Abramsky. The lazy lambda calculus. In D. A. Turner, editor, Research Topics in Functional Programming, pages 65--117. Addison-Wesley, 1990."},{"key":"e_1_3_2_1_5_1","unstructured":"A. Ahmed A. W. Appel and R. Virga. An indexed model of impredicative polymorphism and mutable references. http:\/\/www.cs.princeton.edu\/~amal\/papers\/impred.pdf 2003.  A. Ahmed A. W. Appel and R. Virga. An indexed model of impredicative polymorphism and mutable references. http:\/\/www.cs.princeton.edu\/~amal\/papers\/impred.pdf 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/504709.504712"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754809.1754818"},{"key":"e_1_3_2_1_8_1","volume-title":"Higher Order Operational Techniques in Semantics, volume~41 of Electronic Notes in Theoretical Computer Science","author":"Bierman G. M.","year":"2000","unstructured":"G. M. Bierman , A. M. Pitts , and C. V. Russo . Operational properties of Lily, a polymorphic linear lambda calculus with recursion . In Higher Order Operational Techniques in Semantics, volume~41 of Electronic Notes in Theoretical Computer Science . Elsevier Science , 2000 . G. M. Bierman, A. M. Pitts, and C. V. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. In Higher Order Operational Techniques in Semantics, volume~41 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2000."},{"key":"e_1_3_2_1_9_1","first-page":"458","volume-title":"Relational interpretations of recursive types in an operational setting. Information and Computation, 155(1--2):3--63","author":"Birkedal L.","year":"1999","unstructured":"L. Birkedal and R. Harper . Relational interpretations of recursive types in an operational setting. Information and Computation, 155(1--2):3--63 , 1999 . Summary appeared inphTheoretical Aspects of Computer Software,phLecture Notes in Computer Science, Springer-Verlag , vol. 1281 , pp. 458 -- 490 , 1997. L. Birkedal and R. Harper. Relational interpretations of recursive types in an operational setting. Information and Computation, 155(1--2):3--63, 1999. Summary appeared inphTheoretical Aspects of Computer Software,phLecture Notes in Computer Science, Springer-Verlag, vol. 1281, pp. 458--490, 1997."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788951"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646061.676148"},{"key":"e_1_3_2_1_12_1","first-page":"415","volume-title":"Comparing object encodings. Information and Computation, 155(1--2):108--133","author":"Bruce K. B.","year":"1999","unstructured":"K. B. Bruce , L. Cardelli , and B. C. Pierce . Comparing object encodings. Information and Computation, 155(1--2):108--133 , 1999 . Extended abstract appeared inphTheoretical Aspects of Computer Software, Springer-Verlag , vol. 1281 , pp. 415 -- 338 , 1997. K. B. Bruce, L. Cardelli, and B. C. Pierce. Comparing object encodings. Information and Computation, 155(1--2):108--133, 1999. Extended abstract appeared inphTheoretical Aspects of Computer Software, Springer-Verlag, vol. 1281, pp. 415--338, 1997."},{"key":"e_1_3_2_1_13_1","volume-title":"Draft","author":"Crary K.","year":"2000","unstructured":"K. Crary and R. Harper . Syntactic logical relations over polymorphic and recursive types . Draft , 2000 . K. Crary and R. Harper. Syntactic logical relations over polymorphic and recursive types. Draft, 2000."},{"key":"e_1_3_2_1_14_1","unstructured":"A. D. Gordon. Bisimilarity as a theory of functional programming. mini-course. http:\/\/research.microsoft.com\/~adg\/Publications\/BRICS-NS-95-3.dvi.gz 1995.  A. D. Gordon. Bisimilarity as a theory of functional programming. mini-course. http:\/\/research.microsoft.com\/~adg\/Publications\/BRICS-NS-95-3.dvi.gz 1995."},{"key":"e_1_3_2_1_15_1","first-page":"9","volume-title":"Higher Order Operational Techniques in Semantics","author":"Gordon A. D.","year":"1995","unstructured":"A. D. Gordon . Operational equivalences for untyped and polymorphic object calculi . In Higher Order Operational Techniques in Semantics , pages 9 -- 54 , 1995 . A. D. Gordon. Operational equivalences for untyped and polymorphic object calculi. In Higher Order Operational Techniques in Semantics, pages 9--54, 1995."},{"key":"e_1_3_2_1_16_1","volume-title":"Draft","author":"Gordon A. D.","year":"1995","unstructured":"A. D. Gordon and G. D. Rees . Bisimilarity for F\u2039 :. Draft , 1995 . A. D. Gordon and G. D. Rees. Bisimilarity for F\u2039:. Draft, 1995."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237807"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268976"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788861"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/539036"},{"key":"e_1_3_2_1_22_1","volume-title":"Communication and Concurrency","author":"Milner R.","year":"1995","unstructured":"R. Milner . Communication and Concurrency . Springer-Verlag , 1995 . R. Milner. Communication and Concurrency. Springer-Verlag, 1995."},{"key":"e_1_3_2_1_23_1","volume-title":"Communicating and Mobile Systems: The \u03c0-Calculus","author":"Milner R.","year":"1999","unstructured":"R. Milner . Communicating and Mobile Systems: The \u03c0-Calculus . Cambridge University Press , 1999 . R. Milner. Communicating and Mobile Systems: The \u03c0-Calculus. Cambridge University Press, 1999."},{"key":"e_1_3_2_1_24_1","volume-title":"Foundations for Programming Languages","author":"Mitchell J. C.","year":"1996","unstructured":"J. C. Mitchell . Foundations for Programming Languages . MIT Press , 1996 . J. C. Mitchell. Foundations for Programming Languages. MIT Press, 1996."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/361932.361937"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512938"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/337244.337261"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BFb0055063","volume-title":"Automata, Languages and Programming","author":"Pitts A. M.","year":"1998","unstructured":"A. M. Pitts . Existential types: Logical relations and operational equivalence . In Automata, Languages and Programming , volume 1443 of Lecture Notes in Computer Science , pages 309 -- 326 . Springer-Verlag , 1998 . A. M. Pitts. Existential types: Logical relations and operational equivalence. In Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 309--326. Springer-Verlag, 1998."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500003066"},{"key":"e_1_3_2_1_31_1","first-page":"227","volume-title":"Higher Order Operational Techniques in Semantics","author":"Pitts A. M.","year":"1998","unstructured":"A. M. Pitts and I. Stark . Operational reasoning for functions with local state . In Higher Order Operational Techniques in Semantics , pages 227 -- 273 . Cambridge University Press , 1998 . A. M. Pitts and I. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics, pages 227--273. Cambridge University Press, 1998."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/646727.703207"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964015"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"}],"event":{"name":"POPL05: The 32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2005","location":"Long Beach California USA","acronym":"POPL05","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1040305.1040311","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1040305.1040311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:25:00Z","timestamp":1750249500000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1040305.1040311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1,12]]},"references-count":34,"alternative-id":["10.1145\/1040305.1040311","10.1145\/1040305"],"URL":"https:\/\/doi.org\/10.1145\/1040305.1040311","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1047659.1040311","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,1,12]]},"assertion":[{"value":"2005-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}