{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:50Z","timestamp":1747579550610},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_22","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"310-325","source":"Crossref","is-referenced-by-count":2,"title":["The Informatic Derivative at a Compact Element"],"prefix":"10.1007","author":[{"given":"Keye","family":"Martin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"22_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":"22_CR2","unstructured":"K. Martin, A foundation for computation. Ph.D. Thesis, Department of Mathematics, Tulane University, 2000. http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/keye.martin"},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","volume-title":"A principle of induction","author":"K. Martin","year":"2001","unstructured":"K. Martin, A principle of induction. Lecture Notes in Computer Science, vol. 2142, Springer-Verlag, 2001."},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","volume-title":"A renee equation for algorithmic complexity","author":"K. Martin","year":"2001","unstructured":"K. Martin, A renee equation for algorithmic complexity. Lecture Notes in Computer Science, vol. 2215, Springer-Verlag, 2001."},{"key":"22_CR5","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":"22_CR6","doi-asserted-by":"crossref","unstructured":"K. Martin, Powerdomains and zero finding. Electronic Notes in Theoretical Computer Science, vol 59.3, 2001, to appear.","DOI":"10.1016\/S1571-0661(04)00287-7"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"K. Martin, Unique fixed points in domain theory. Proceedings of MFPS XVII, Electronic Notes in Theoretical Computer Science, vol. 45, 2001.","DOI":"10.1016\/S1571-0661(04)80966-6"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T00:22:45Z","timestamp":1707956565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}