{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:34:47Z","timestamp":1725496487528},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668565"},{"type":"electronic","value":"9783540466741"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46674-6_7","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T15:50:17Z","timestamp":1196351417000},"page":"62-73","source":"Crossref","is-referenced-by-count":34,"title":["Observable Sharing for Functional Circuit Description"],"prefix":"10.1007","author":[{"given":"Koen","family":"Claessen","sequence":"first","affiliation":[]},{"given":"David","family":"Sands","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A call-byneed lambda calculus. In Proc. POPL\u201995, ACM Press, 1995.","DOI":"10.1145\/199448.199507"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola and A. Sabry. Correctness of monadic state: An imperative call-by-need calculus. In Proc. POPL\u201998, pages 62\u201374. ACM Press, 1998.","DOI":"10.1145\/268946.268952"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"P. Bjesse, K. Claessen, M. Sheeran, and S. Singh. Lava: Hardware design in Haskell. In ICFP\u201998. ACM Press, 1998.","DOI":"10.1145\/289423.289440"},{"key":"7_CR4","unstructured":"B. Cook, J. Launchbury, and J. Matthews. Specifying superscalar microprocessors in Hawk. In Formal Techniques for Hardware and Hardware-like Systems. Marstrand, Sweden, 1998."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Matthias Felleisen and Robert Hieb. The revised report on the syntactic theories of sequential control and state. TCS, 103:235\u2013271, 1992.","journal-title":"TCS"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/242224.242477","volume":"28","author":"P. Hudak","year":"1996","unstructured":"Paul Hudak. Building domain-specific embedded languages. ACM Computing Surveys, 28(4):196, December 1996.","journal-title":"ACM Computing Surveys"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"J. Launchbury. A natural semantics for lazy evaluation. In Proc. POPL\u201993, pages 144\u2013154. ACM Press, 1993.","DOI":"10.1145\/158511.158618"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner. Fully abstract models of the typed \u03bbcalculus. TCS 4:1\u201322, 1977.","journal-title":"TCS"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Andrew Moran and David Sands. Improvement in a lazy context: An operational theory for call-by-need. In Proc. POPL\u201999, ACM Press, 1999.","DOI":"10.1145\/292540.292547"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I. Mason","year":"1991","unstructured":"I. Mason and C. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1(3):287\u2013327, July 1991.","journal-title":"Journal of Functional Programming"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"J. O\u2019Donnell. Generating netlists from executable circuit specifications in a pure functional language. In Functional Programming Glasgow, Springer-Verlag Workshops in Computing, pages 178\u2013194, 1993.","DOI":"10.1007\/978-1-4471-3215-8_16"},{"key":"7_CR12","first-page":"221","volume":"1125","author":"J. O\u2019Donnell","year":"1996","unstructured":"J. O\u2019 Donnell. From transistors to computer architecture: Teaching functional circuit specification in Hydra. In Functional Programming Languagues in Education, LNCS vol 1125, pages 221\u2013234. Springer Verlag, 1996.","journal-title":"Functional Programming Languagues in Education"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Martin Odersky. A functional theory of local names. In POPL\u201994, pages 48\u201359, ACM Press, 1994.","DOI":"10.1145\/174675.175187"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"A. M. Pitts. Reasoning about local variables with operationally-based logical relations. In 11th Annual Symposium on Logic in Computer Science, pages 152\u2013163. IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561314"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones, W. Partain, and A. Santos. Let-floating: moving bindings to give faster programs. In Proc. ICFP\u201996, pages 1\u201312. ACM Press, 1996.","DOI":"10.1145\/232627.232630"},{"issue":"1-3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(97)00029-4","volume":"32","author":"S. Peyton Jones","year":"1998","unstructured":"S. Peyton Jones and A. Santos. A transformation-based optimiser for Haskell. Science of Computer Programming, 32(1-3):3\u201347, 1998.","journal-title":"Science of Computer Programming"},{"key":"7_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-57182-5_8","volume-title":"MFCS\u201993","author":"A. M. Pitts","year":"1993","unstructured":"A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that create local names, or: What\u2019s new? In MFCS\u201993, LNCS vol 711, pages 122\u2013141, Springer-Verlag, 1993."},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"P. Sestoft. Deriving a lazy abstract machine. Journal of Functional Pro-gramming, 7(3:231\u2013264, May 1997.","journal-title":"Journal of Functional Pro-gramming"},{"key":"7_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-15212-1","volume-title":"FPCS\u201995","author":"M. Sheeran","year":"1985","unstructured":"M. Sheeran. Designing regular array architectures using higher order functions. In FPCS\u201995, LNCS vol 201, Springer Verlag, 1985."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"P. Wadler. Monads for Functional Programming. In Lecture notes for Marktoberdorf Summer School on Program Design Calculi, NATO ASI Series F: Computer and systems sciences. Springer Verlag, August 1992.","DOI":"10.1007\/978-3-662-02880-3_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46674-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T08:56:27Z","timestamp":1557046587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46674-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668565","9783540466741"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46674-6_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}