{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:05:12Z","timestamp":1746158712881,"version":"3.40.4"},"publisher-location":"London","reference-count":16,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540197355"},{"type":"electronic","value":"9781447137948"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-1-4471-3794-8_5","type":"book-chapter","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T11:23:28Z","timestamp":1387452208000},"page":"66-79","source":"Crossref","is-referenced-by-count":1,"title":["A Tiny Functional Language with Logical Features"],"prefix":"10.1007","author":[{"given":"Ross","family":"Paterson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"M. Abdali, L. Cardelli, P.-L. Curien, and J.-J. L\u00e9vy. Explicit substitutions. In 17th Annual ACM Symposium on Principles of Programming Languages pages 31\u201346,1990.","DOI":"10.1145\/96709.96712"},{"key":"5_CR2","volume-title":"6th International Conference on Automata","author":"E Astesiano","year":"1979","unstructured":"E. Astesiano and G. Costa. Sharing in nondeterminism. In 6th International Conference on Automata, Languages and Programming, volume 71 of Lecture Notes in Computer Science, 1979."},{"key":"5_CR3","unstructured":"H. P. Barendregt. North Holland, 2nd edition, 1984."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Rod M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the ACM24(1):44\u201367, 1977.","DOI":"10.1145\/321992.321996"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"M. C. B. Hennessy. The semantics of call-by-value and call-by-name in a nondeterministic environment. SIAM Journal on Computing9(1):67\u201384, 1980.","DOI":"10.1137\/0209005"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"M. C. B. Hennessy and E. A. Ashcroft. Parameter passing mechanisms and nondeterminism. In 9th Annual ACM Symposium on Theory of Computing,pages 306\u2013311","DOI":"10.1145\/800105.803420"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(80)90015-8","volume":"11","author":"MC Hennessy","year":"1980","unstructured":"M. C. B. Hennessy and E. A. Ashcroft. A mathematical semantics for a nondeterministic typed.A-calculus. Theoretical Computer Science, 11: 227\u2013245, 1980.","journal-title":"Theoretical Computer Science"},{"key":"5_CR8","volume-title":"Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, pages 1-10, Pittsburgh","author":"J Hughes","year":"1982","unstructured":"John Hughes. Supercombinators - a new implementation technique for applicative languages. In Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, pages 1\u201310, Pittsburgh, 1982."},{"key":"5_CR9","first-page":"95","volume":"71","author":"D Macqueen","year":"1986","unstructured":"David MacQueen, Gordon D. Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. Information and Computation, 71: 95\u2013130, 1986.","journal-title":"Information and Computation"},{"key":"5_CR10","first-page":"115","volume":"33","author":"G Michael","year":"1987","unstructured":"Michael G. Main. A powerdomain primer. Bulletin of the EATCS, 33: 115\u2013147, October 1987.","journal-title":"Bulletin of the Eatcs"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences17(3):348\u2013375, 1978.","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"5_CR12","unstructured":"Simon L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice Hall, Englewood Cliffs, NJ, 1987."},{"key":"5_CR13","volume-title":"Siam Journal on Computing","author":"D Gordon","year":"1976","unstructured":"Gordon D. Plotkin. A powerdomain construction. SIAM Journal on Computing, 1976."},{"key":"5_CR14","unstructured":"Frank S. K. Silbermann. A Denotational Semantics Approach to Functional and Logic Programming. PhD thesis, Tulane University, 1989."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Frank S. K. Silbermann and Bharat Jayaraman. Set abstraction in functional and logic programming. In Conference on Functional Programming Languages and Computer ArchitectureLondon, 1989. ACM.","DOI":"10.1145\/99370.99398"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Mike B. Smyth. Powerdomains. Journal of Computer and System Sciences16:23\u201336, 1978.","DOI":"10.1016\/0022-0000(78)90048-X"}],"container-title":["Workshops in Computing","Declarative Programming, Sasbachwalden 1991"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3794-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T07:56:25Z","timestamp":1746086185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-3794-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540197355","9781447137948"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3794-8_5","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1992]]}}}