{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:41:25Z","timestamp":1742924485838,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148041"},{"type":"electronic","value":"9783030148058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14805-8_6","type":"book-chapter","created":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T08:04:29Z","timestamp":1550649869000},"page":"94-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Type Inference System Based on Saturation of Subtyping Constraints"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Vaugon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Mauny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,21]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Aiken, A., Wimmers, E.L.: Type inclusion constraints and type inference. In: Functional Programming and Computer Architecture, pp. 31\u201341. ACM, Copenhagen (1993)","DOI":"10.1145\/165180.165188"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Aiken, A., Wimmers, E.L., Lakshman, T.K.: Soft typing with conditional types. In: Principles of Programming Languages, pp. 163\u2013173. ACM, Portland (1994)","DOI":"10.1145\/174675.177847"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-22102-1_9","volume-title":"Interactive Theorem Proving","author":"A Chargu\u00e9raud","year":"2015","unstructured":"Chargu\u00e9raud, A., Pottier, F.: Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 137\u2013153. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-22102-1_9"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Dolan, S., Mycroft, A.: Polymorphism, subtyping and type inference in MLsub. In: Principles of Programming Languages (2017)","DOI":"10.1145\/3009837.3009882"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/S1571-0661(04)80008-2","volume":"1","author":"J Eifrig","year":"1995","unstructured":"Eifrig, J., Smith, S., Trifonov, V.: Type inference for recursively constrained types and its application to OOP. Electron. Notes Theor. Comput. Sci. 1, 132\u2013153 (1995)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/3540543961_22","volume-title":"Functional Programming Languages and Computer Architecture","author":"F Henglein","year":"1991","unstructured":"Henglein, F.: Efficient type inference for higher-order binding-time analysis. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 448\u2013472. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3540543961_22"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. Trans. Program. Lang. Syst. 4(2), 258\u2013282 (1982)","journal-title":"Trans. Program. Lang. Syst."},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-319-12736-1_6","volume-title":"Programming Languages and Systems","author":"Zachary Palmer","year":"2014","unstructured":"Palmer, Z., Menon, P.H., Rozenshteyn, A., Smith, S.: Types for flexible objects. In: Asian Symposium on Programming Languages and Systems, pp. 99\u2013119 (2014)"},{"issue":"9","key":"6_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1160074.1159811","volume":"41","author":"SP Jones","year":"2006","unstructured":"Jones, S.P., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. SIGPLAN Not. 41(9), 50\u201361 (2006)","journal-title":"SIGPLAN Not."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Pottier, F.: A framework for type inference with subtyping. In: International Conference on Functional Programming, pp. 228\u2013238, September 1998","DOI":"10.1145\/289423.289448"},{"issue":"4","key":"6_CR11","first-page":"312","volume":"7","author":"F Pottier","year":"2000","unstructured":"Pottier, F.: A versatile constraint-based type inference system. Nordic J. Comput. 7(4), 312\u2013347 (2000)","journal-title":"Nordic J. Comput."},{"key":"6_CR12","unstructured":"Simonet, V., Pottier, F.: Constraint-based type inference for guarded algebraic data types. Research Report 5462. INRIA, January 2005"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/3-540-46425-5_25","volume-title":"Programming Languages and Systems","author":"SF Smith","year":"2000","unstructured":"Smith, S.F., Wang, T.: Polyvariant flow analysis with constrained types. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, pp. 382\u2013396. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/3-540-46425-5_25"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-61739-6_52","volume-title":"Static Analysis","author":"V Trifonov","year":"1996","unstructured":"Trifonov, V., Smith, S.: Subtyping constrained types. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145, pp. 349\u2013365. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/3-540-61739-6_52"},{"key":"6_CR15","unstructured":"Vaugon, B., Sous-typage par saturation de contraintes: th\u00e9orie et impl\u00e9mentation. Ph.D. thesis. Universit\u00e9 Paris-Saclay (2016). \n                      https:\/\/pastel.archives-ouvertes.fr\/tel-01356695\/document"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"AK Wright","year":"1992","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput. 115, 38\u201394 (1992)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14805-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:20:30Z","timestamp":1558340430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-14805-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148041","9783030148058"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14805-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"College Park, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"56% - 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"}},{"value":"3,7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,35","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}