{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:48:14Z","timestamp":1775868494652,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540557075","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023861","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:02:35Z","timestamp":1132380155000},"page":"33-44","source":"Crossref","is-referenced-by-count":10,"title":["Strictness logic and polymorphic invariance"],"prefix":"10.1007","author":[{"given":"P. N.","family":"Benton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"1","volume-title":"volume 217 of Lecture Notes in Computer Science","author":"S. Abramsky","year":"1985","unstructured":"Samson Abramsky. Strictness analysis and polymorphic invariance (extended abstract). In H. Ganzinger and N. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, Copenhagen, volume 217 of Lecture Notes in Computer Science, pages 1\u201323. Springer-Verlag, October 1985."},{"issue":"1\u20132","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"Samson Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51(1\u20132):1\u201378, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Samson Abramsky and Thomas P. Jensen. A relational approach to strictness analysis of higher order polymorphic functions. In Proceedings of ACM Symposium on Principles of Programming Languages, 1991.","DOI":"10.1145\/99583.99593"},{"key":"4_CR4","unstructured":"P. N. Benton. Static Analyses and Optimising Transformations for Lazy Functional Programs. PhD thesis, University of Cambridge, 1992. in preparation."},{"key":"4_CR5","volume-title":"volume 217 of Lecture Notes in Computer Science","author":"G. L. Burn","year":"1985","unstructured":"Geoffrey L. Burn, Chris L. Hankin, and Samson Abramsky. The theory of strictness analysis for higher order functions. In H. Ganzinger and N. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, Copenhagen, volume 217 of Lecture Notes in Computer Science. Springer-Verlag, October 1985."},{"key":"4_CR6","unstructured":"R.J.M. Hughes. Abstract interpretation of first-order polymorphic functions. In Glasgow Workshop on Functional Programming, August 1988."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Thomas P. Jensen. Strictness analysis in logical form. In Proceedings of the 1991 Conference on Functional Programming Languages and Computer Architecture, 1991.","DOI":"10.1007\/3540543961_17"},{"key":"4_CR8","unstructured":"P. T. Johnstone. Stone Spaces. Cambridge studies in advanced mathematics. Cambridge University Press, 1982."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"T.-M. Kuo and P. Mishra. Strictness analysis: A new perspective based on type inference. In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture. ACM, 1989.","DOI":"10.1145\/99370.99390"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"John C. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 8, pages 365\u2013458. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"4_CR11","unstructured":"Alan Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, Department of Computer Science, University of Edinburgh, December 1981."},{"key":"4_CR12","volume-title":"volume 217 of Lecture Notes in Computer Science","author":"A. Mycroft","year":"1985","unstructured":"Alan Mycroft and Neil D. Jones. A relational framework for abstract interpretation. In H. Ganzinger and N. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, Copenhagen, volume 217 of Lecture Notes in Computer Science. Springer-Verlag, October 1985."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science \u2014 Tver '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T03:17:41Z","timestamp":1572923861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540557075"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0023861","relation":{},"subject":[]}}