{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:13:03Z","timestamp":1762459983029,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030737849"},{"type":"electronic","value":"9783030737856"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73785-6_2","type":"book-chapter","created":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T06:02:50Z","timestamp":1618034570000},"page":"13-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Wheel of Rational Numbers as an Abstract Data Type"],"prefix":"10.1007","author":[{"given":"Jan A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John V.","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,11]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(87)90123-X","volume":"50","author":"JA Bergstra","year":"1987","unstructured":"Bergstra, J.A., Tucker, J.V.: Algebraic specifications of computable and semicomputable data types. Theoret. Comput. Sci. 50, 137\u2013181 (1987)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR2","first-page":"1","volume":"1","author":"JA Bergstra","year":"2019","unstructured":"Bergstra, J.A.: Division by zero: a survey of options. Transmathematica 1(1), 1\u201320 (2019). https:\/\/transmathematica.org\/index.php\/journal\/article\/view\/17","journal-title":"Transmathematica"},{"issue":"12\u201313","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1016\/j.tcs.2008.12.015","volume":"410","author":"JA Bergstra","year":"2009","unstructured":"Bergstra, J.A., Hirshfeld, Y., Tucker, J.V.: Meadows and the equational specification of division. Theoret. Comput. Sci. 410(12\u201313), 1261\u20131271 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jal.2011.03.001","volume":"9","author":"JA Bergstra","year":"2011","unstructured":"Bergstra, J.A., Middelburg, C.A.: Inversive meadows and divisive meadows. J. Appl. Logic 9(3), 203\u2013220 (2011)","journal-title":"J. Appl. Logic"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jal.2016.03.001","volume":"16","author":"JA Bergstra","year":"2016","unstructured":"Bergstra, J.A., Middelburg, C.A.: Transformation of fractions into simple fractions in divisive meadows. J. Appl. Logic 16, 92\u2013110 (2016)","journal-title":"J. Appl. Logic"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-15545-6_6","volume-title":"Software, Services, and Systems","author":"JA Bergstra","year":"2015","unstructured":"Bergstra, J.A., Ponse, A.: Division by zero in common meadows. In: De Nicola, R., Hennicker, R. (eds.) Software, Services, and Systems. LNCS, vol. 8950, pp. 46\u201361. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15545-6_6"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.indag.2016.01.007","volume":"27","author":"JA Bergstra","year":"2016","unstructured":"Bergstra, J.A., Ponse, A.: Fracpairs and fractions over a reduced commutative ring. Indag. Math. 27, 727\u2013748 (2016)","journal-title":"Indag. Math."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-72044-9_6","volume-title":"Recent Trends in Algebraic Development Techniques","author":"JA Bergstra","year":"2017","unstructured":"Bergstra, J.A., Ponse, A.: Probability functions in the context of signed involutive meadows (extended abstract). In: James, P., Roggenbach, M. (eds.) WADT 2016. LNCS, vol. 10644, pp. 73\u201387. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72044-9_6"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(82)80021-1","volume":"54","author":"JA Bergstra","year":"1982","unstructured":"Bergstra, J.A., Tucker, J.V.: The completeness of the algebraic specification methods for computable data types. Inf. Control 54(3), 186\u2013200 (1982)","journal-title":"Inf. Control"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1137\/0212024","volume":"12","author":"JA Bergstra","year":"1983","unstructured":"Bergstra, J.A., Tucker, J.V.: Initial and final algebra semantics for data type specifications: two characterization theorems. SIAM J. Comput. 12(2), 366\u2013387 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1219092.1219095","volume":"54","author":"JA Bergstra","year":"2007","unstructured":"Bergstra, J.A., Tucker, J.V.: The rational numbers as an abstract data type. J. ACM 54(2), 7 (2007)","journal-title":"J. ACM"},{"issue":"3\u20134","key":"2_CR12","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s00224-007-9035-4","volume":"43","author":"JA Bergstra","year":"2008","unstructured":"Bergstra, J.A., Tucker, J.V.: Division safe calculation in totalised fields. Theory Comput. Syst. 43(3\u20134), 410\u2013424 (2008). https:\/\/doi.org\/10.1007\/s00224-007-9035-4","journal-title":"Theory Comput. Syst."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1017\/S0960129503004110","volume":"14","author":"J Carlstrom","year":"2004","unstructured":"Carlstrom, J.: Wheels: on division by zero. Math. Struct. Comput. Sci. 14, 143\u2013184 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR14","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specification 1: Equations und Initial Semantics","author":"H Ehrig","year":"1985","unstructured":"Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1: Equations und Initial Semantics. EATCS, vol. 6. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-69962-7"},{"key":"2_CR15","volume-title":"Specification of Abstract Data Types","author":"J Loeckx","year":"1996","unstructured":"Loeckx, J., Ehrich, H., Wolf, M.: Specification of Abstract Data Types. Wiley, Hoboken (1996)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Meinke, K., Tucker, J.V.: Universal algebra. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science. Volume I: Mathematical Structures, pp. 189\u2013411. Oxford University Press (1992)","DOI":"10.1093\/oso\/9780198537359.003.0003"},{"issue":"1","key":"2_CR17","first-page":"11","volume":"46","author":"T dos Reis","year":"2016","unstructured":"dos Reis, T., Gomide, W., Anderson, J.A.: Construction of the transreal numbers and algebraic transfields. IAENG Int. J. Appl. Math. 46(1), 11\u201323 (2016)","journal-title":"IAENG Int. J. Appl. Math."},{"key":"2_CR18","unstructured":"Setzer, A.: Wheels (draft) (1997). http:\/\/www.cs.swan.ac.uk\/~csetzer\/articles\/wheel.pdf"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Effective algebras. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science. Volume IV: Semantic Modelling, pp. 357\u2013526. Oxford University Press (1995)","DOI":"10.1093\/oso\/9780198537809.003.0004"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Computable rings and fields. In: Griffor, E. (ed.) Handbook of Computability Theory, pp. 363\u2013447. Elsevier (1999)","DOI":"10.1016\/S0049-237X(99)80028-7"},{"key":"2_CR21","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-76771-5","volume-title":"Universal Algebra for Computer Scientists","author":"W Wechler","year":"1992","unstructured":"Wechler, W.: Universal Algebra for Computer Scientists. EATCS, vol. 25. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/978-3-642-76771-5"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73785-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T01:35:29Z","timestamp":1724808929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73785-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030737849","9783030737856"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73785-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algebraic Development Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wadt2020.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}