{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:05:29Z","timestamp":1746331529460,"version":"3.40.4"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319089171"},{"type":"electronic","value":"9783319089188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08918-8_2","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T05:44:22Z","timestamp":1404279862000},"page":"21-30","source":"Crossref","is-referenced-by-count":0,"title":["Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk)"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Turner, D.A. (ed.) Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley (1990)"},{"key":"2_CR2","unstructured":"Aprove-team: AProVE website (2014), http:\/\/aprove.informatik.rwth-aachen.de"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bird, R.: Pearls of Functional Algorithm Design. Cambridge University Press, Cambridge (2010)","DOI":"10.1017\/CBO9780511763199"},{"key":"2_CR4","unstructured":"Bird, R.S., De Moor, O.: Algebra of Programming. International Series in Computer Science, vol.\u00a0100. Prentice Hall (1997)"},{"key":"2_CR5","unstructured":"Gill, A.: Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Glasgow University, Department of Computing Science (1996)"},{"key":"2_CR6","unstructured":"Haskell-community: The Haskell Programming Language (2014), http:\/\/www.haskell.org\/haskellwiki\/Haskell"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Howe, D.: Equality in lazy computation systems. In: 4th IEEE Symp. on Logic in Computer Science, pp. 198\u2013203 (1989)","DOI":"10.1109\/LICS.1989.39174"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D. Howe","year":"1996","unstructured":"Howe, D.: Proving congruence of bisimulation in functional programming languages. Inform. and Comput.\u00a0124(2), 103\u2013112 (1996)","journal-title":"Inform. and Comput."},{"issue":"1-2","key":"2_CR9","first-page":"63","volume":"69","author":"P. Johann","year":"2006","unstructured":"Johann, P., Voigtl\u00e4nder, J.: The impact of seq on free theorems-based program transformations. Fundamenta Informaticae\u00a069(1-2), 63\u2013102 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR10","unstructured":"Jones, M.P.: Dictionary-free Overloading by PaRTIAL Evaluation. In: Partial Evaluation and Semantics-Based Program Manipulation, Orlando, Florida, pp. 107\u2013117. Technical Report 94\/9, Department of Computer Science, University of Melbourne (June 1994)"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1145\/243439.243447","volume":"28","author":"N.D. Jones","year":"1996","unstructured":"Jones, N.D.: An introduction to partial evaluation. ACM Comput. Surv.\u00a028(3), 480\u2013503 (1996)","journal-title":"ACM Comput. Surv."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1996.0061","volume":"128","author":"I. Mason","year":"1996","unstructured":"Mason, I., Smith, S.F., Talcott, C.L.: From operational semantics to domain theory. Inform. and Comput.\u00a0128, 26\u201347 (1996)","journal-title":"Inform. and Comput."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0049-237X(08)72018-4","volume-title":"Computer Programming and Formal Systems","author":"J. McCarthy","year":"1963","unstructured":"McCarthy, J.: A Basis for a Mathematical Theory of Computation. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 33\u201370. North-Holland, Amsterdam (1963)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner, R.: Fully abstract models of typed \u03bb-calculi. Theoret. Comput. Sci.\u00a04, 1\u201322 (1977)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Functions as processes. Mathematical Structures in Computer Science\u00a02(2), 119\u2013141 (1992)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, i & ii. Inform. and Comput.\u00a0100(1), 1\u201377 (1992)","journal-title":"Inform. and Comput."},{"key":"2_CR17","unstructured":"Morris, J.: Lambda-Calculus Models of Programming Languages. PhD thesis, MIT (1968)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S., Partain, W., Santos, A.: Let-floating: moving bindings to give faster programs. In: Harper, R., Wexelblat, R.L. (eds.) Proceedings of the first ACM SIGPLAN International Conference on Functional Programming, pp. 1\u201312. ACM Press (1996)","DOI":"10.1145\/232629.232630"},{"issue":"1-3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(97)00029-4","volume":"32","author":"S.L. Peyton Jones","year":"1998","unstructured":"Peyton Jones, S.L., Santos, A.L.M.: A transformation-based optimiser for Haskell. Science of Computer Programming\u00a032(1-3), 3\u201347 (1998)","journal-title":"Science of Computer Programming"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value, and the lambda-calculus. Theoret. Comput. Sci.\u00a01, 125\u2013159 (1975)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR21","unstructured":"Rau, C.: Automatic correctness proofs of program transformations (2014) (thesis in preparation)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-31365-3_36","volume-title":"Automated Reasoning","author":"C. Rau","year":"2012","unstructured":"Rau, C., Sabel, D., Schmidt-Schau\u00df, M.: Correctness of program transformations as a termination problem. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol.\u00a07364, pp. 462\u2013476. Springer, Heidelberg (2012)"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0960129508006774","volume":"18","author":"D. Sabel","year":"2008","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Math. Structures Comput. Sci.\u00a018(3), 501\u2013553 (2008)","journal-title":"Math. Structures Comput. Sci."},{"key":"2_CR24","first-page":"101","volume-title":"PPDP 2011","author":"D. Sabel","year":"2011","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: A contextual semantics for Concurrent Haskell with futures. In: Schneider-Kamp, P., Hanus, M. (eds.) PPDP 2011, pp. 101\u2013112. ACM, New York (2011)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: Conservative concurrency in Haskell. In: Dershowitz, N. (ed.) LICS, pp. 561\u2013570. IEEE (2012)","DOI":"10.1109\/LICS.2012.66"},{"key":"2_CR26","series-title":"IFIP","first-page":"521","volume-title":"5th IFIP TCS 2008","author":"M. Schmidt-Schau\u00df","year":"2008","unstructured":"Schmidt-Schau\u00df, M., Niehren, J., Schwinghammer, J., Sabel, D.: Adequacy of compositional translations for observational semantics. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, C.H.L. (eds.) 5th IFIP TCS 2008. IFIP, vol.\u00a0273, pp. 521\u2013535. Springer, Heidelberg (2008)"},{"issue":"11-13","key":"2_CR27","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.tcs.2009.12.001","volume":"411","author":"M. Schmidt-Schau\u00df","year":"2010","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: On generic context lemmas for higher-order calculi with sharing. Theoret. Comput. Sci.\u00a0411(11-13), 1521\u20131541 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: Correctness of an STM Haskell implementation. In: Morrisett, G., Uustalu, T. (eds.) Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, pp. 161\u2013172. ACM, New York (2013)","DOI":"10.1145\/2544174.2500585"},{"key":"2_CR29","unstructured":"Schmidt-Schau\u00df, M., Sabel, D., Machkasova, E.: Simulation in the call-by-need lambda-calculus with letrec. In: Lynch, C. (ed.) Proc. of 21st RTA 2010. LIPIcs, vol.\u00a06, pp. 295\u2013310. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1051\/ita:2007010","volume":"41","author":"M. Schmidt-Schau\u00df","year":"2007","unstructured":"Schmidt-Schau\u00df, M., Sabel, D., Sch\u00fctz, M.: Deciding inclusion of set constants over infinite non-strict data structures. RAIRO-Theoretical Informatics and Applications\u00a041(2), 225\u2013241 (2007)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1017\/S0956796807006624","volume":"18","author":"M. Schmidt-Schau\u00df","year":"2008","unstructured":"Schmidt-Schau\u00df, M., Sch\u00fctz, M., Sabel, D.: Safety of N\u00f6cker\u2019s strictness analysis. J. Funct. Programming\u00a018(4), 503\u2013551 (2008)","journal-title":"J. Funct. Programming"},{"key":"2_CR32","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1596627.1596633","volume-title":"ML 2009: Proceedings of the 2009 ACM SIGPLAN Workshop on ML","author":"J. Schwinghammer","year":"2009","unstructured":"Schwinghammer, J., Sabel, D., Schmidt-Schau\u00df, M., Niehren, J.: Correctly translating concurrency primitives. In: Rossberg, A. (ed.) ML 2009: Proceedings of the 2009 ACM SIGPLAN Workshop on ML, pp. 27\u201338. ACM, New York (2009)"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-41582-1_6","volume-title":"Implementation and Application of Functional Languages","author":"N. Sculthorpe","year":"2013","unstructured":"Sculthorpe, N., Farmer, A., Gill, A.: The HERMIT in the tree - mechanizing program transformations in the GHC core language. In: Hinze, R. (ed.) IFL 2012. LNCS, vol.\u00a08241, pp. 86\u2013103. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Rewriting and Typed Lambda Calculi"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08918-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:44:47Z","timestamp":1746290687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08918-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089171","9783319089188"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08918-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}