{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:46:59Z","timestamp":1725893219123},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344060"},{"type":"electronic","value":"9783642344077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34407-7_7","type":"book-chapter","created":{"date-parts":[[2012,11,5]],"date-time":"2012-11-05T19:58:14Z","timestamp":1352145494000},"page":"100-115","source":"Crossref","is-referenced-by-count":1,"title":["From Stack Traces to Lazy Rewriting Sequences"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Chang","sequence":"first","affiliation":[]},{"given":"Eli","family":"Barzilay","sequence":"additional","affiliation":[]},{"given":"John","family":"Clements","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Allwood, T.O., Peyton Jones, S., Eisenbach, S.: Finding the needle: stack traces for GHC. In: Proc. 2nd Symp. on Haskell, pp. 129\u2013140 (2009)","DOI":"10.1145\/1596638.1596654"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: The call-by-need \u03bb calculus. In: Proc. 22nd POPL, pp. 233\u2013246 (1995)","DOI":"10.1145\/199448.199507"},{"key":"7_CR3","unstructured":"Augustson, M., Reinfelds, J.: A visual miranda machine. In: Proc. Software Education Conference SRIG-ET, pp. 233\u2013246 (1995)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chitil, O., Luo, Y.: Structure and properties of traces for functional programs. In: Proc. 3rd Intl. Works. Term Graph Rewriting, pp. 39\u201363 (2006)","DOI":"10.1016\/j.entcs.2006.10.032"},{"key":"7_CR5","unstructured":"Clements, J.: Portable and High-level Access to the Stack with Continuation Marks. Ph.D. thesis, Northeastern University (2006)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45309-1_21","volume-title":"Programming Languages and Systems","author":"J. Clements","year":"2001","unstructured":"Clements, J., Flatt, M., Felleisen, M.: Modeling an Algebraic Stepper. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 320\u2013334. Springer, Heidelberg (2001)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Ennals, R., Peyton Jones, S.: HsDebug: debugging lazy programs by not being lazy. In: Proc. Works. on Haskell, pp. 84\u201387 (2003)","DOI":"10.1145\/871895.871904"},{"key":"7_CR8","unstructured":"Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex. MIT Press (2009)"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","volume":"69","author":"M. Felleisen","year":"1989","unstructured":"Felleisen, M., Friedman, D.P.: A syntactic theory of sequential state. Theor. Comput. Sci.\u00a069(3), 243\u2013287 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR10","unstructured":"Foubister, S.P.: Graphical Application and Visualisation of Lazy Functional Computation. Ph.D. thesis, University of York (1995)"},{"key":"7_CR11","unstructured":"Gibbons, J., Wansbrough, K.: Tracing lazy functional languages. In: Proc. CATS, pp. 11\u201320 (1996)"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/comjnl\/37.3.177","volume":"37","author":"D. Goldson","year":"1994","unstructured":"Goldson, D.: A symbolic calculator for non-strict functional languages. Comput. J.\u00a037(3), 177\u2013187 (1994)","journal-title":"Comput. J."},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J. Hughes","year":"1989","unstructured":"Hughes, J.: Why functional programming matters. Comput. J.\u00a032(2), 98\u2013107 (1989)","journal-title":"Comput. J."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Keller, R.: Formal verification of parallel programs. Commun. ACM\u00a019(7) (1976)","DOI":"10.1145\/360248.360251"},{"key":"7_CR15","unstructured":"Kishon, A.: Theory and Art of Semantics-Directed Program Execution Monitoring. Ph.D. thesis, Yale University (1992)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01807507","volume":"5","author":"G. Lapalme","year":"1992","unstructured":"Lapalme, G., Latendresse, M.: A debugging environment for lazy functional languages. LISP and Symbolic Computation\u00a05(3), 271\u2013287 (1992)","journal-title":"LISP and Symbolic Computation"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Marlow, S., Iborra, J., Pope, B., Gill, A.: A lightweight interactive debugger for Haskell. In: Proc. Works. on Haskell, pp. 13\u201324 (2007)","DOI":"10.1145\/1291201.1291204"},{"key":"7_CR18","unstructured":"Naish, L.: Declarative debugging of lazy functional programs. In: Proc. 16th ACSC (1993)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Nilsson, H., Fritzson, P.: Algorithmic debugging for lazy functional languages. In: Proc. 4th PLIPL, pp. 385\u2013399 (1992)","DOI":"10.1007\/3-540-55844-6_149"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01806168","volume":"1","author":"J.T. O\u2019Donnell","year":"1988","unstructured":"O\u2019Donnell, J.T., Hall, C.V.: Debugging in applicative languages. LISP and Symbolic Computation\u00a01(2), 113\u2013145 (1988)","journal-title":"LISP and Symbolic Computation"},{"key":"7_CR21","unstructured":"Patel, M.J., du Boulay, B., Taylor, C.: Effect of format on information and problem solving. In: Proc. 13th Conf. of the Cognitive Science Society, pp. 852\u2013856 (1991)"},{"key":"7_CR22","unstructured":"Penney, A.: Augmenting Trace-based Functional Debugging. Ph.D. thesis, University of Bristol, Australia (1999)"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF03037471","volume":"8","author":"R.M. Snyder","year":"1990","unstructured":"Snyder, R.M.: Lazy debugging of lazy functional programs. New Generation Computing\u00a08, 139\u2013161 (1990)","journal-title":"New Generation Computing"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Sparud, J., Runciman, C.: Tracing lazy functional computations using redex trails. In: Proc. 9th PLILP, pp. 291\u2013308 (1997)","DOI":"10.1007\/BFb0033851"},{"key":"7_CR25","unstructured":"Taylor, J.P.: Presenting the Lazy Evaluation of Functions. Ph.D. thesis, Queen Mary and Westfield College (1996)"},{"key":"7_CR26","unstructured":"Wallace, M., Chitil, O., Brehm, T., Runciman, C.: Multiple-view tracing for Haskell: a new hat. In: Proc. Works. on Haskell, pp. 151\u2013170 (2001)"},{"key":"7_CR27","unstructured":"Watson, R.D.: Tracing Lazy Evaluation by Program Transformation. Ph.D. thesis, Southern Cross University, Australia (1997)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34407-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:52:49Z","timestamp":1620118369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34407-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344060","9783642344077"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34407-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}