{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:31:26Z","timestamp":1676892686735},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10990-012-9087-2","type":"journal-article","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T04:24:45Z","timestamp":1349238285000},"page":"311-340","source":"Crossref","is-referenced-by-count":2,"title":["Functional un|unparsing"],"prefix":"10.1007","volume":"24","author":[{"given":"Kenichi","family":"Asai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Kiselyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-chieh","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,4]]},"reference":[{"issue":"3","key":"9087_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10990-009-9049-5","volume":"22","author":"K. Asai","year":"2009","unstructured":"Asai, K.: On typing delimited continuations: three new solutions to the printf problem. Higher-Order Symb. Comput. 22(3), 275\u2013291 (2009)","journal-title":"Higher-Order Symb. Comput."},{"key":"9087_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-76637-7_16","volume-title":"Proceedings of APLAS 2007: 5th Asian Symposium on Programming Languages and Systems","author":"K. Asai","year":"2007","unstructured":"Asai, K., Kameyama, Y.: Polymorphic delimited continuations. In: Shao, Z. (ed.) Proceedings of APLAS 2007: 5th Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science, vol. 4807, pp. 239\u2013254. Springer, Berlin (2007)"},{"issue":"5","key":"9087_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1017\/S0956796809007205","volume":"19","author":"J. Carette","year":"2009","unstructured":"Carette, J., Kiselyov, O., Shan, C.-c.: Finally tagless, partially evaluated: tagless staged interpreters for simpler typed languages. J. Funct. Program. 19(5), 509\u2013543 (2009)","journal-title":"J. Funct. Program."},{"issue":"6","key":"9087_CR4","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1017\/S0956796898003104","volume":"8","author":"O. Danvy","year":"1998","unstructured":"Danvy, O.: Functional unparsing. J. Funct. Program. 8(6), 621\u2013625 (1998)","journal-title":"J. Funct. Program."},{"key":"9087_CR5","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Tech. Rep. 89\/12, DIKU, University of Copenhagen, Denmark (1989). http:\/\/www.cs.au.dk\/~danvy\/Papers\/fatc.ps.gz"},{"issue":"6","key":"9087_CR6","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1017\/S0956796807006259","volume":"17","author":"R.K. Dybvig","year":"2007","unstructured":"Dybvig, R.K., Peyton Jones, S.L., Sabry, A.: A monadic framework for delimited continuations. J. Funct. Program. 17(6), 687\u2013730 (2007)","journal-title":"J. Funct. Program."},{"key":"9087_CR7","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/62678.62684","volume-title":"Proceedings of the 1988 ACM Conference on Lisp and Functional Programming","author":"M. Felleisen","year":"1988","unstructured":"Felleisen, M., Wand, M., Friedman, D.P., Duba, B.F.: Abstract continuations: a mathematical semantics for handling full jumps. In: Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pp. 52\u201362. ACM Press, New York (1988)"},{"key":"9087_CR8","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/800055.802051","volume-title":"Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming","author":"D.P. Friedman","year":"1984","unstructured":"Friedman, D.P., Wand, M.: Reification: reflection without metaphysics. In: Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, pp. 348\u2013355. ACM Press, New York (1984). 1984"},{"key":"9087_CR9","volume-title":"Essentials of Programming Languages","author":"D.P. Friedman","year":"2008","unstructured":"Friedman, D.P., Wand, M.: Essentials of Programming Languages, 3rd edn. MIT Press, Cambridge (2008)","edition":"3"},{"key":"9087_CR10","first-page":"80","volume-title":"Current Trends in Programming Methodology","author":"J.A. Goguen","year":"1978","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Yeh, R.T. (ed.) Current Trends in Programming Methodology, vol. 4, pp. 80\u2013149. Prentice-Hall, Englewood Cliffs (1978)"},{"key":"9087_CR11","first-page":"12","volume-title":"Functional Programming Languages and Computer Architecture: 7th Conference","author":"C.A. Gunter","year":"1995","unstructured":"Gunter, C.A., R\u00e9my, D., Riecke, J.G.: A generalization of exceptions and control in ML-like languages. In: Peyton Jones, S.L. (ed.) Functional Programming Languages and Computer Architecture: 7th Conference, pp. 12\u201323. ACM Press, New York (1995)"},{"key":"9087_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/800055.802046","volume-title":"Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming","author":"C.T. Haynes","year":"1984","unstructured":"Haynes, C.T., Friedman, D.P., Wand, M.: Continuations and coroutines. In: Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, pp. 293\u2013298. ACM Press, New York (1984)"},{"issue":"5","key":"9087_CR13","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1017\/S0956796802004367","volume":"13","author":"R. Hinze","year":"2003","unstructured":"Hinze, R.: Formatting: a class act. J. Funct. Program. 13(5), 935\u2013944 (2003)","journal-title":"J. Funct. Program."},{"issue":"4es","key":"9087_CR14","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/242224.242477","volume":"28","author":"P. Hudak","year":"1996","unstructured":"Hudak, P.: Building domain-specific embedded languages. ACM Comput. Surv. 28(4es), 196 (1996)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"9087_CR15","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S0956796899003500","volume":"9","author":"G. Hutton","year":"1999","unstructured":"Hutton, G.: A tutorial on the universality and expressiveness of fold. J. Funct. Program. 9(4), 355\u2013372 (1999)","journal-title":"J. Funct. Program."},{"key":"9087_CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/944705.944722","volume-title":"ICFP 03: Proceedings of the ACM International Conference on Functional Programming","author":"Y. Kameyama","year":"2003","unstructured":"Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: ICFP 03: Proceedings of the ACM International Conference on Functional Programming, pp. 177\u2013188. ACM Press, New York (2003)"},{"issue":"1","key":"9087_CR17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/357195.357202","volume":"5","author":"S. Kamin","year":"1983","unstructured":"Kamin, S.: Final data types and their specification. ACM Trans. Program. Lang. Syst. 5(1), 97\u2013121 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9087_CR18","doi-asserted-by":"crossref","first-page":"12","DOI":"10.3115\/980190.980193","volume-title":"TINLAP75: Proceedings of the 1975 Workshop on Theoretical Issues in Natural Language Processing","author":"M. Kay","year":"1975","unstructured":"Kay, M.: Syntactic processing and functional sentence perspective. In: TINLAP75: Proceedings of the 1975 Workshop on Theoretical Issues in Natural Language Processing, pp. 12\u201315. Association for Computational Linguistics, Stroudsburg (1975)"},{"key":"9087_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/978-3-642-12251-4_22","volume-title":"Proc. FLOPS 2010: 10th International Symposium on Functional and Logic Programming","author":"O. Kiselyov","year":"2010","unstructured":"Kiselyov, O.: Delimited control in OCaml, abstractly and concretely: system description. In: Proc. FLOPS 2010: 10th International Symposium on Functional and Logic Programming. Lecture Notes in Computer Science, vol. 6009, pp. 304\u2013320. Springer, Berlin (2010)"},{"key":"9087_CR20","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/1159803.1159808","volume-title":"ICFP 06: Proceedings of the ACM International Conference on Functional Programming","author":"O. Kiselyov","year":"2006","unstructured":"Kiselyov, O., Shan, C.-c., Sabry, A.: Delimited dynamic binding. In: ICFP 06: Proceedings of the ACM International Conference on Functional Programming, pp. 26\u201337. ACM Press, New York (2006)"},{"key":"9087_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/41625.41632","volume-title":"POPL 87: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"E.E. Kohlbecker","year":"1987","unstructured":"Kohlbecker, E.E., Wand, M.: Macro-by-example: deriving syntactic transformations from their specifications. In: POPL 87: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 77\u201384. ACM Press, New York (1987)"},{"key":"9087_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/1596627.1596636","volume-title":"ACM SIGPLAN Workshop on ML","author":"M. Masuko","year":"2009","unstructured":"Masuko, M., Asai, K.: Direct implementation of shift and reset in the MinCaml compiler. In: ACM SIGPLAN Workshop on ML, pp. 49\u201360. ACM Press, New York (2009)"},{"key":"9087_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-15648-8_17","volume-title":"Logics of Programs","author":"A.R. Meyer","year":"1985","unstructured":"Meyer, A.R., Wand, M.: Continuation semantics in typed lambdacalculi (summary). In: Parikh, R. (ed.) Logics of Programs. Lecture Notes in Computer Science, vol. 193, pp. 219\u2013224. Springer, Berlin (1985)"},{"key":"9087_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1863523.1863525","volume-title":"Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell","author":"T. Rendel","year":"2010","unstructured":"Rendel, T., Ostermann, K.: Invertible syntax descriptions: unifying parsing and pretty printing. In: Gibbons, J. (ed.) Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell, pp. 1\u201312. ACM Press, New York (2010)"},{"issue":"1","key":"9087_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796897002943","volume":"8","author":"A. Sabry","year":"1998","unstructured":"Sabry, A.: What is a purely functional language? J. Funct. Program. 8(1), 1\u201322 (1998)","journal-title":"J. Funct. Program."},{"key":"9087_CR26","doi-asserted-by":"crossref","first-page":"614","DOI":"10.3115\/991719.991764","volume-title":"COLING88: Proceedings of the 12th International Conference on Computational Linguistics","author":"S.M. Shieber","year":"1988","unstructured":"Shieber, S.M.: A uniform architecture for parsing and generation. In: COLING88: Proceedings of the 12th International Conference on Computational Linguistics, vol. 2, pp. 614\u2013619 (1988)"},{"key":"9087_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-642-03153-3_6","volume-title":"Language Engineering and Rigorous Software Development","author":"S.D. Swierstra","year":"2009","unstructured":"Swierstra, S.D.: Combinator parsers: a short tutorial. In: Bove, A., Barbosa, L., Pardo, A., Sousa Pinto, J. (eds.) Language Engineering and Rigorous Software Development. Lecture Notes in Computer Science, vol. 5520, pp. 252\u2013300. Springer, Berlin (2009)"},{"issue":"2","key":"9087_CR28","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P.L. Wadler","year":"1990","unstructured":"Wadler, P.L.: Deforestation: transforming programs to eliminate trees. Theor. Comput. Sci. 73(2), 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9087_CR29","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","volume":"19","author":"M. Wand","year":"1979","unstructured":"Wand, M.: Final algebra semantics and data type extensions. J. Comput. Syst. Sci. 19(1), 27\u201344 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"9087_CR30","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/800087.802786","volume-title":"Proceedings of the 1980 ACM Conference on Lisp and Functional Programming","author":"M. Wand","year":"1980","unstructured":"Wand, M.: Continuation-based multiprocessing. In: Proceedings of the 1980 ACM Conference on Lisp and Functional Programming, pp.\u00a019\u201328. ACM Press, New York (1980). Reprinted in Higher-Order Symb. Comput. 12(3), 285\u2013299 (1999)"},{"issue":"1","key":"9087_CR31","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/322169.322183","volume":"27","author":"M. Wand","year":"1980","unstructured":"Wand, M.: Continuation-based program transformation strategies. J. ACM 27(1), 164\u2013180 (1980)","journal-title":"J. ACM"},{"issue":"3","key":"9087_CR32","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/357172.357179","volume":"4","author":"M. Wand","year":"1982","unstructured":"Wand, M.: Deriving target code as a representation of continuation semantics. ACM Transactions on Programming Languages and Systems 4(3), 496\u2013517 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"9087_CR33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(82)90097-4","volume":"20","author":"M. Wand","year":"1982","unstructured":"Wand, M.: Specifications, models, and implementations of data abstractions. Theoretical Computer Science 20(1), 3\u201332 (1982)","journal-title":"Theoretical Computer Science"},{"key":"9087_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/318593.318602","volume-title":"POPL 85: Conference record of the annual ACM symposium on principles of programming languages","author":"M. Wand","year":"1985","unstructured":"Wand, M.: Embedding type structure in semantics. In: POPL 85: Conference record of the annual ACM symposium on principles of programming languages, pp. 1\u20136. ACM Press, New York (1985)"},{"key":"9087_CR35","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/604131.604150","volume-title":"POPL 03: Conference Record of the Annual ACM Symposium on Principles of Programming Languages","author":"H. Xi","year":"2003","unstructured":"Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: POPL 03: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 224\u2013235. ACM Press, New York (2003)"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9087-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-012-9087-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9087-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T07:09:41Z","timestamp":1562224181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-012-9087-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9087"],"URL":"https:\/\/doi.org\/10.1007\/s10990-012-9087-2","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}