{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:41:50Z","timestamp":1743007310005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030399504"},{"type":"electronic","value":"9783030399511"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39951-1_8","type":"book-chapter","created":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T19:02:22Z","timestamp":1580670142000},"page":"122-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Probabilistic Reasoning in Type Theory - The Intersection Type Case"],"prefix":"10.1007","author":[{"given":"Silvia","family":"Ghilezan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jelena","family":"Iveti\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona","family":"Ka\u0161terovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoran","family":"Ognjanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nenad","family":"Savi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"8_CR1","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"HP Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North Holland Publishing Company, Amsterdam (1984)"},{"key":"8_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139032636","volume-title":"Lambda Calculus with Types. Perspectives in Logic","author":"HP Barendregt","year":"2013","unstructured":"Barendregt, H.P., Dekkers, W., Statman, R.: Lambda Calculus with Types. Perspectives in Logic. Cambridge University Press, Cambridge (2013). \nhttp:\/\/www.cambridge.org\/de\/academic\/subjects\/mathematics\/logic-categories-and-sets\/lambda-calculus-types"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H Barendregt","year":"1983","unstructured":"Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. J. Symb. Logic 48(4), 931\u2013940 (1983). \nhttps:\/\/doi.org\/10.2307\/2273659","journal-title":"J. Symb. Logic"},{"key":"8_CR4","unstructured":"Barendregt, H.P.: Lambda calculi with types. In: Handbook of Logic in Computer Science. vol. 2, pp. 117\u2013309. Oxford University Press Inc, New York (1992). \nhttp:\/\/dl.acm.org\/citation.cfm?id=162552.162561"},{"key":"8_CR5","unstructured":"Ben-Yelles, C.B.: Type assignment in the lambda-calculus: syntax and semantics. Ph.D. thesis, Department of Pure Mathematics, University College of Swansea, September 1979"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. J. Symb. Logic 5(2), 56\u201368 (1940). \nhttps:\/\/doi.org\/10.2307\/2266170","journal-title":"J. Symb. Logic"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M Coppo","year":"1978","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: A new type assignment for $$\\lambda $$-terms. Arch. Math. Log. 19(1), 139\u2013156 (1978). \nhttps:\/\/doi.org\/10.1007\/BF02011875","journal-title":"Arch. Math. Log."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-54833-8_12","volume-title":"Programming Languages and Systems","author":"R Crubill\u00e9","year":"2014","unstructured":"Crubill\u00e9, R., Dal Lago, U.: On probabilistic applicative bisimulation and call-by-value $$\\lambda $$-calculi. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 209\u2013228. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54833-8_12"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-23506-6_7","volume-title":"Correct System Design","author":"R Crubill\u00e9","year":"2015","unstructured":"Crubill\u00e9, R., Dal Lago, U., Sangiorgi, D., Vignudelli, V.: On applicative similarity, sequentiality, and full abstraction. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 65\u201382. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23506-6_7"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Sangiorgi, D., Alberti, M.: On coinductive equivalences for higher-order probabilistic functional programs. In: POPL, pp. 297\u2013308. ACM (2014)","DOI":"10.1145\/2535838.2535872"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02759729","volume":"2","author":"H Gaifman","year":"1964","unstructured":"Gaifman, H.: Concerning measures in first order calculi. Israel J. Math. 2(1), 1\u201318 (1964). \nhttps:\/\/doi.org\/10.1007\/BF02759729","journal-title":"Israel J. Math."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1305\/ndjfl\/1040067315","volume":"37","author":"S Ghilezan","year":"1996","unstructured":"Ghilezan, S.: Strong normalization and typability with intersection types. Notre Dame J. Form. Logic 37(1), 44\u201352 (1996). \nhttps:\/\/doi.org\/10.1305\/ndjfl\/1040067315","journal-title":"Notre Dame J. Form. Logic"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-72056-2_11","volume-title":"Logical Foundations of Computer Science","author":"S Ghilezan","year":"2018","unstructured":"Ghilezan, S., Iveti\u0107, J., Ka\u0161terovi\u0107, S., Ognjanovi\u0107, Z., Savi\u0107, N.: Probabilistic reasoning about simply typed lambda terms. In: Artemov, S., Nerode, A. (eds.) LFCS 2018. LNCS, vol. 10703, pp. 170\u2013189. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-72056-2_11"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1080\/00029890.1965.11970533","volume":"72","author":"T Hailperin","year":"1965","unstructured":"Hailperin, T.: Best possible inequalities for the probability of a logical function of events. Am. Math. Monthly 72(4), 343\u2013359 (1965). \nhttp:\/\/www.jstor.org\/stable\/2313491","journal-title":"Am. Math. Monthly"},{"issue":"270","key":"8_CR15","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1093\/mind\/LXVIII.270.234","volume":"68","author":"CL Hamblin","year":"1959","unstructured":"Hamblin, C.L.: The modal \u201cprobably\u201d. Mind 68(270), 234\u2013240 (1959). \nhttps:\/\/doi.org\/10.1093\/mind\/LXVIII.270.234","journal-title":"Mind"},{"key":"8_CR16","series-title":"Cambridge Tracts in Theoretical Computer Science 42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"JR Hindley","year":"1997","unstructured":"Hindley, J.R.: Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science 42. Cambridge University Press, Cambridge (1997). \nhttp:\/\/gen.lib.rus.ec\/book\/index.php?md5=3BB4134A46F16E81D2D16744850F44EA"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"JR Hindley","year":"1980","unstructured":"Hindley, J.R., Longo, G.: Lambda-calculus models and extesionality. Math. Logic Q. 26, 289\u2013310 (1980)","journal-title":"Math. Logic Q."},{"key":"8_CR18","unstructured":"Ikodinovi\u0107, N., Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M., Markovi\u0107, Z.: First-order probabilistic logics and their applications. In: Zbornik radova, Subseries Logic in Computer Science, vol. 18, no. 26, pp. 37\u201378. Matemati\u010dki institut(2015)"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Ka\u0161terovi\u0107, S., Pagani, M.: The discriminating power of the let-in operator in the lazy call-by-name probabilistic lambda-calculus. In: 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, 24\u201330 June 2019, Dortmund, Germany, pp. 26:1\u201326:20 (2019). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.26","DOI":"10.4230\/LIPIcs.FSCD.2019.26"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0168-0072(86)90063-1","volume":"31","author":"H Keisler","year":"1986","unstructured":"Keisler, H.: Hyperfinite models of adapted probability logic. Ann. Pure Appl. Logic 31, 71\u201386 (1986). \nhttps:\/\/doi.org\/10.1016\/0168-0072(86)90063-1\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0168007286900631","journal-title":"Ann. Pure Appl. Logic"},{"key":"8_CR21","unstructured":"Kraus, M.: Early Greek probability arguments and common ground in dissensus. In: Ontario Society for the Study of Argumentation (OSSA) Proceedings, pp. 1\u201311. OSSA Conference Archive (2007)"},{"key":"8_CR22","volume-title":"Foundations of Statistical Natural Language Processing","author":"CD Manning","year":"1999","unstructured":"Manning, C.D., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"NJ Nilsson","year":"1986","unstructured":"Nilsson, N.J.: Probabilistic logic. Artif. Intell. 28(1), 71\u201387 (1986). \nhttps:\/\/doi.org\/10.1016\/0004-3702(86)90031-7","journal-title":"Artif. Intell."},{"key":"8_CR24","unstructured":"Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M., Markovi\u0107, Z.: Probability logics. In: Zborik radova, Subseries logic in computer science, vol. 12, no. 20, pp. 35\u2013111. Matemati\u010dki institut (2009)"},{"key":"8_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47012-2","volume-title":"Probability Logics: Probability-Based Formalization of Uncertain Reasoning","author":"Z Ognjanovi\u0107","year":"2016","unstructured":"Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M., Markovi\u0107, Z.: Probability Logics: Probability-Based Formalization of Uncertain Reasoning. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-47012-2"},{"key":"8_CR26","series-title":"Morgan Kaufmann series in representation and reasoning","volume-title":"Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference","author":"J Pearl","year":"1989","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference. Morgan Kaufmann series in representation and reasoning. Morgan Kaufmann, San Mateo (1989)"},{"key":"8_CR27","unstructured":"Thurn, S.: Exploring Artificial Intelligence in the New Millennium, chap. Robotic Mapping: A Survey, pp. 1\u201335. Morgan Kaufmann Publishers Inc., San Francisco (2003), \nhttp:\/\/dl.acm.org\/citation.cfm?id=779343.779345"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39951-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T05:48:20Z","timestamp":1580795300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39951-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030399504","9783030399511"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39951-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoIKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations of Information and Knowledge Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"foiks2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/foiks2020.cs.tu-dortmund.de\/","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":"33","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":"19","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":"58% - 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":"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)"}}]}}