{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:34:55Z","timestamp":1756636495753},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720555"},{"type":"electronic","value":"9783319720562"}],"license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-72056-2_11","type":"book-chapter","created":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T09:33:31Z","timestamp":1511775211000},"page":"170-189","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Reasoning About Simply Typed Lambda Terms"],"prefix":"10.1007","author":[{"given":"Silvia","family":"Ghilezan","sequence":"first","affiliation":[]},{"given":"Jelena","family":"Iveti\u0107","sequence":"additional","affiliation":[]},{"given":"Simona","family":"Ka\u0161terovi\u0107","sequence":"additional","affiliation":[]},{"given":"Zoran","family":"Ognjanovi\u0107","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Savi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1049","volume":"112","author":"M Abadi","year":"1994","unstructured":"Abadi, M., Halpern, J.Y.: Decidability and expressiveness for first-order logics of probability. Inf. Comput. 112(1), 1\u201336 (1994)","journal-title":"Inf. Comput."},{"issue":"8","key":"11_CR2","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.scico.2007.09.002","volume":"74","author":"P Audebaud","year":"2009","unstructured":"Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74(8), 568\u2013589 (2009)","journal-title":"Sci. Comput. Program."},{"key":"11_CR3","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North Holland, New York (1984)"},{"key":"11_CR4","doi-asserted-by":"crossref","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)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-662-46678-0_18","volume-title":"Foundations of Software Science and Computation Structures","author":"A Bizjak","year":"2015","unstructured":"Bizjak, A., Birkedal, L.: Step-indexed logical relations for probability. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 279\u2013294. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46678-0_18"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Cooper, R., Dobnik, S., Lappin, S., Larsson, S.: A probabilistic rich type theory for semantic interpretation. In: Proceedings of the EACL 2014 Workshop on Type Theory and Natural Language Semantics (TTNLS), pp. 72\u201379 (2014)","DOI":"10.3115\/v1\/W14-1409"},{"issue":"3","key":"11_CR7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1093\/logcom\/exs054","volume":"23","author":"D Doder","year":"2013","unstructured":"Doder, D., Grant, J., Ognjanovi\u0107, Z.: Probabilistic logics for objects located in space and time. J. Logic Comput. 23(3), 487\u2013515 (2013)","journal-title":"J. Logic Comput."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Ehrhard, T., Pagani, M., Tasson, C.: The computational meaning of probabilistic coherence spaces. In: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, pp. 87\u201396 (2011)","DOI":"10.1109\/LICS.2011.29"},{"issue":"1\/2","key":"11_CR9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","volume":"87","author":"R Fagin","year":"1990","unstructured":"Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Inf. Comput. 87(1\/2), 78\u2013128 (1990)","journal-title":"Inf. Comput."},{"issue":"4","key":"11_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00370648","volume":"46","author":"M Fattorosi-Barnaba","year":"1987","unstructured":"Fattorosi-Barnaba, M., Amati, G.: Modal operators with probabilistic interpretations. I. Studia Logica 46(4), 383\u2013393 (1987)","journal-title":"I. Studia Logica"},{"issue":"20","key":"11_CR11","first-page":"159","volume":"12","author":"S Ghilezan","year":"2009","unstructured":"Ghilezan, S., Likavec, S.: Computational interpretations of logics. Zbornik radova, Special Issue Logic and Computer Science, Matemati\u010dki institut 12(20), 159\u2013215 (2009)","journal-title":"Zbornik radova, Special Issue Logic and Computer Science, Matemati\u010dki institut"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Goodman, N.D.: The principles and practice of probabilistic programming. In: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, pp. 399\u2013402 (2013)","DOI":"10.1145\/2429069.2429117"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90136-6","volume":"22","author":"JR Hindley","year":"1983","unstructured":"Hindley, J.R.: The completeness theorem for typing lambda-terms. Theor. Comput. Sci. 22, 1\u201317 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR14","series-title":"Cambridge Tracts in Theoretical Computer Science 42","doi-asserted-by":"crossref","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)"},{"key":"11_CR15","doi-asserted-by":"crossref","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."},{"issue":"26","key":"11_CR16","first-page":"37","volume":"18","author":"N Ikodinovi\u0107","year":"2015","unstructured":"Ikodinovi\u0107, N., Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M., Markovi\u0107, Z.: First-order probabilistic logics and their applications. Zbornik radova, Subseries Logic in Computer Science, Matemati\u010dki institut 18(26), 37\u201378 (2015)","journal-title":"Zbornik radova, Subseries Logic in Computer Science, Matemati\u010dki institut"},{"issue":"4","key":"11_CR17","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1093\/jigpal\/jzv025","volume":"23","author":"I Kokkinis","year":"2015","unstructured":"Kokkinis, I., Maksimovi\u0107, P., Ognjanovi\u0107, Z., Studer, T.: First steps towards probabilistic justification logic. Logic J. IGPL 23(4), 662\u2013687 (2015)","journal-title":"Logic J. IGPL"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-27683-0_13","volume-title":"Logical Foundations of Computer Science","author":"I Kokkinis","year":"2016","unstructured":"Kokkinis, I., Ognjanovi\u0107, Z., Studer, T.: Probabilistic justification logic. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 174\u2013186. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27683-0_13"},{"issue":"3","key":"11_CR19","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1051\/ita\/2012012","volume":"46","author":"UD Lago","year":"2012","unstructured":"Lago, U.D., Zorzi, M.: Probabilistic operational semantics for the lambda calculus. RAIRO Theor. Inform. Appl. 46(3), 413\u2013450 (2012)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"4","key":"11_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1002\/malq.200310044","volume":"49","author":"Z Markovi\u0107","year":"2003","unstructured":"Markovi\u0107, Z., Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M.: A probabilistic extension of intuitionistic logic. Math. Logic Q. 49(4), 415\u2013424 (2003)","journal-title":"Math. Logic Q."},{"issue":"1","key":"11_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.apal.2013.07.015","volume":"165","author":"RS Milnikel","year":"2014","unstructured":"Milnikel, R.S.: The logic of uncertain justifications. Ann. Pure Appl. Logic 165(1), 305\u2013315 (2014)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"11_CR22","doi-asserted-by":"crossref","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)","journal-title":"Artif. Intell."},{"issue":"2","key":"11_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1093\/logcom\/exi077","volume":"16","author":"Z Ognjanovi\u0107","year":"2006","unstructured":"Ognjanovi\u0107, Z.: Discrete linear-time probabilistic logics: completeness, decidability and complexity. J. Logic Comput. 16(2), 257\u2013285 (2006)","journal-title":"J. Logic Comput."},{"issue":"20","key":"11_CR24","first-page":"35","volume":"12","author":"Z Ognjanovi\u0107","year":"2009","unstructured":"Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M., Markovi\u0107, Z.: Probability logics. Zborik radova, Subseries Logic in Computer Science, Matemati\u010dki institut 12(20), 35\u2013111 (2009)","journal-title":"Zborik radova, Subseries Logic in Computer Science, Matemati\u010dki institut"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M., Markovi\u0107, Z.: Probability Logics: Probability-Based Formalization of Uncertain Reasoning. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-47012-2"},{"key":"11_CR26","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ijar.2017.05.013","volume":"88","author":"N Savi\u0107","year":"2017","unstructured":"Savi\u0107, N., Doder, D., Ognjanovi\u0107, Z.: Logics with lower and upper probability operators. Int. J. Approx. Reason. 88, 148\u2013168 (2017)","journal-title":"Int. J. Approx. Reason."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72056-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T09:36:39Z","timestamp":1511775399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72056-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"ISBN":["9783319720555","9783319720562"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72056-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,11,28]]}}}