DC FieldValueLanguage
dc.contributor.authorGhilezan, Silviaen
dc.contributor.authorIvetić, Jelenaen
dc.contributor.authorKašterović, Simonaen
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorSavić, Nenaden
dc.date.accessioned2020-05-02T16:42:18Z-
dc.date.available2020-05-02T16:42:18Z-
dc.date.issued2020-01-01en
dc.identifier.isbn978-3-030-39950*4en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2573-
dc.description.abstractThe development of different probabilistic models of uncertainty has been inspired by the rapid progress in various fields, e.g. in AI, probabilistic programming, etc. Lambda calculus is a universal model of computation suitable to express programming languages concepts. Hence, different methods for probabilistic reasoning in lambda calculus have been investigated. In this paper, we develop a formal model for probabilistic reasoning about lambda terms with intersection types, which is a combination of lambda calculus and probabilistic logic. The language of lambda calculus with intersection types is endowed with a probabilistic operator. We propose a semantics based on the possible world approach. An infinitary axiomatization is given for this system and it is proved to be sound with respect to the proposed semantics.en
dc.publisherSpringer Link-
dc.relationRepresentations of logical structures and formal languages and their application in computing-
dc.relationDevelopment of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education-
dc.relationSwiss National Science Foundation, Grant 200021 165549-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectIntersection types | Kripke-style semantics | Lambda calculus | Probabilistic reasoning | Soundnessen
dc.titleTowards Probabilistic Reasoning in Type Theory - The Intersection Type Caseen
dc.typeConference Paperen
dc.relation.conference11th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2020; Dortmund; Germany; 17 February 2020 through 21 February 2020-
dc.identifier.doi10.1007/978-3-030-39951-1_8en
dc.identifier.scopus2-s2.0-85080881257en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage122en
dc.relation.lastpage139en
dc.relation.volume12012 LNCSen
dc.description.rankM33-
item.fulltextNo Fulltext-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2253-8285-
crisitem.author.orcid0000-0003-2508-6480-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174026e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/044006e.php-
crisitem.project.fundingProgramDirectorate for Social, Behavioral & Economic Sciences-
crisitem.project.fundingProgramNATIONAL HEART, LUNG, AND BLOOD INSTITUTE-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Social, Behavioral & Economic Sciences/1740267-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NIH/NATIONAL HEART, LUNG, AND BLOOD INSTITUTE/5R01HL044006-04-
Show simple item record

Page view(s)

29
checked on Jan 31, 2025

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.