{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:52Z","timestamp":1747579552204},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425540"},{"type":"electronic","value":"9783540448020"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_32","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"458-468","source":"Crossref","is-referenced-by-count":2,"title":["A Principle of Induction"],"prefix":"10.1007","author":[{"given":"Keye","family":"Martin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky and A. Jung, Domain theory. In S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, vol. III. Oxford University Press, 1994.","DOI":"10.1093\/oso\/9780198537625.001.0001"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"P. Aczel, An introduction to inductive definitions. In Handbook of Mathematical Logic, J. Barwise, Editor, North-Holland, p. 739\u2013782.","DOI":"10.1016\/S0049-237X(08)71120-0"},{"key":"32_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BFb0021089","volume-title":"Constructive topology and combinatorics","author":"T. Coquand","year":"1992","unstructured":"T. Coquand, Constructive topology and combinatorics. Lecture Notes in Computer Science, vol. 613, p. 159\u2013164."},{"key":"32_CR4","unstructured":"T. Coquand, A note on the open induction principle. http:\/\/www.cs.chalmers.se\/ coquand\/open.ps.Z"},{"issue":"1","key":"32_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(98)00099-1","volume":"210","author":"M. Escardo","year":"1999","unstructured":"M. Escardo and T. Streicher, Induction and recursion on the partial real line with applications to Real PCF. Theoretical Computer Science, volume 210, number 1, p. 121\u2013157, 1999.","journal-title":"Theoretical Computer Science"},{"key":"32_CR6","unstructured":"K. Martin, A foundation for computation. Ph.D. Thesis, Department of Mathematics, Tulane University, May 2000. http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/keye.mart in"},{"key":"32_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_11","volume-title":"Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP)","author":"K. Martin","year":"2000","unstructured":"K. Martin, The measurement process in domain theory. Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 1853, Springer-Verlag, 2000."},{"key":"32_CR8","unstructured":"L.C. Paulson, ML for the Working Programmer. Cambridge University Press, 1991."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:17:23Z","timestamp":1707934643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}