{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:37Z","timestamp":1761611317245,"version":"3.40.4"},"publisher-location":"London","reference-count":28,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540199144"},{"type":"electronic","value":"9781447135739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3573-9_6","type":"book-chapter","created":{"date-parts":[[2013,1,5]],"date-time":"2013-01-05T06:22:28Z","timestamp":1357366948000},"page":"78-95","source":"Crossref","is-referenced-by-count":16,"title":["A Tutorial on Co-induction and Functional Programming"],"prefix":"10.1007","author":[{"given":"Andrew D.","family":"Gordon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Thesis","author":"S Abramsky","year":"1987","unstructured":"Abramsky, S. ( 1987, October 5). Domain Theory and the Logic of Observable Properties. Ph. D. thesis, Queen Mary College, University of London."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S. and L. Ong (1993). Full abstraction in the lazy lambda calculus. Information and Computation 105, 159\u2013267.","journal-title":"Information and Computation"},{"key":"6_CR3","volume-title":"North-Holland","author":"P Aczel","year":"1977","unstructured":"Aczel, P. (1977). An introduction to inductive definitions. In J. Barwise (Ed.), Handbook of Mathematical Logic, pp. 739\u2013782. North-Holland."},{"key":"6_CR4","unstructured":"Bird, R. and P. Wadler (1988). Introduction to Functional Programming. Prentice-Hall."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bloom, B. (1988). Can LCF be topped? Flat lattice models of typed lambda calculus. In Proceedings 3rd LICS, pp. 282\u2013295.","DOI":"10.1109\/LICS.1988.5127"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Crole, R. L. and A. D. Gordon (1994, September). A sound metalogical semantics for input\/output effects. In Computer Science Logic\u201994, Kazimierz, Poland. Proceedings to appear in Springer LNCS.","DOI":"10.1007\/BFb0022267"},{"key":"6_CR7","unstructured":"Davey, B. A. and H. A. Priestley (1990). Introduction to Lattices and Order. Cambridge University Press."},{"key":"6_CR8","unstructured":"Felleisen, M. and D. Friedman (1986). Control operators, the SECD-machine, and the A-calculus. In Formal Description of Programming Concepts III, pp. 193\u2013217. North-Holland."},{"key":"6_CR9","volume-title":"Submitted for publication","author":"AD Gordon","year":"1994","unstructured":"Gordon, A. D. (1994a). Bisimilarity as a theory of functional programming. Submitted for publication."},{"key":"6_CR10","volume-title":"(1994b). Functional Programming and Input\/Output. Cambridge University Press","author":"AD Gordon","year":"1992","unstructured":"Gordon, A. D. (1994b). Functional Programming and Input\/Output. Cambridge University Press. Revision of 1992 PhD dissertation."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Howe, D. J. (1989). Equality in lazy computation systems. In Proceedings 4th LICS, pp. 198\u2013203.","DOI":"10.1109\/LICS.1989.39174"},{"key":"6_CR12","first-page":"73","volume-title":"Spp","author":"J Hughes","year":"1993","unstructured":"Hughes, J. and A. Moran (1993, June). Natural semantics for non-determinism. In Proceedings of El Winterm\u00f6te, pp. 211\u2013222. Chalmers PMG. Available as Report 73."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Milner, R. (1977). Fully abstract models of typed lambda-calculi. TCS 4, 1\u201323.","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"6_CR14","unstructured":"Milner, R. (1989). Communication and Concurrency. Prentice-Hall."},{"key":"6_CR15","volume-title":"Ph","author":"JH Morris","year":"1968","unstructured":"Morris, J. H. ( 1968, December). Lambda-Calculus Models of Programming Languages. Ph. D. thesis, MIT."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ong, C.-H. L. (1993, June). Non-determinism in a functional setting (extended abstract). In Proceedings 8th LICS, pp. 275\u2013286.","DOI":"10.1109\/LICS.1993.287580"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Ong, C.-H. L. (1994, January). Correspondence between operational and denotational semantics: The full abstraction problem for PCF. Submitted to Handbook of Logic in Computer Science Volume 3, OUP 1994.","DOI":"10.1093\/oso\/9780198537809.003.0003"},{"key":"6_CR18","volume-title":"Springer-Verlag","author":"D Park","year":"1981","unstructured":"Park, D. (1981, March). Concurrency and automata on infinite sequences. In P. Deussen (Ed.), Theoretical Computer Science: 5th GI-Conference, Volume 104 of Lecture Notes in Computer Science, pp. 167\u2013183. Springer-Verlag."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Pitts, A. and I. Stark (1993, June). On the observable properties of higher order functions that dynamically create local names (preliminary report). In SIPL\u201993, pp. 31\u201345.","DOI":"10.1007\/3-540-57182-5_8"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Pitts, A. M. (1994). A co-induction principle for recursively defined domains. TCS 124, 195\u2013219.","DOI":"10.1016\/0304-3975(94)90014-0"},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"Plotkin, G. D. (1977). LCF considered as a programming language. TCS 5, 223\u2013255.","journal-title":"TCS"},{"key":"6_CR22","volume-title":"To appear in TLCA95","author":"E Ritter","year":"1994","unstructured":"Ritter, E. and A. M. Pitts (1994, September). A fully abstract translation between a A-calculus with reference types and Standard ML. To appear in TLCA\u201995."},{"key":"6_CR23","volume-title":"A Logic of Functional Programs with an Application to Concurrency. Ph","author":"H Sander","year":"1992","unstructured":"Sander, H. (1992). A Logic of Functional Programs with an Application to Concurrency. Ph. D. thesis, Chalmers PMG."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Sands, D. (1992). Operational theories of improvement in functional languages (extended abstract). In Functional Programming, Glasgow 1991, Workshops in Computing, pp. 298\u2013311. Springer-Verlag.","DOI":"10.1007\/978-1-4471-3196-0_24"},{"key":"6_CR25","volume-title":"University of Copenhagen","author":"D Sands","year":"1994","unstructured":"Sands, D. (1994, May). Total correctness and improvement in the transformation of functional programs (1st draft). DIKU, University of Copenhagen."},{"key":"6_CR26","unstructured":"Smith, S. F. (1991). From operational to denotational semantics. In MFPS VII, Pittsburgh, Volume 598 of Lecture Notes in Computer Science, pp. 54\u201376. Springer-Verlag."},{"key":"6_CR27","unstructured":"Turner, D. (Ed.) (1990). Research Topics in Functional Programming. Addison-Wesley."},{"key":"6_CR28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages","author":"G Winskel","year":"1993","unstructured":"Winskel, G. (1993). The Formal Semantics of Programming Languages. MIT Press, Cambridge, Mass."}],"container-title":["Workshops in Computing","Functional Programming, Glasgow 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3573-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:08:42Z","timestamp":1745942922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3573-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199144","9781447135739"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3573-9_6","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1995]]}}}