Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Simona Kašterović"'
Autor:
Silvia Ghilezan, Simona Kašterović
Publikováno v:
Frontiers in Computer Science, Vol 4 (2022)
There is a plethora of semantics of computational models, nevertheless, the semantics of combinatory logic are among the less investigated ones. In this paper, we propose semantics for the computational system of combinatory logic with intersection t
Externí odkaz:
https://doaj.org/article/993039e16e194a1382ace08587e6ad31
Autor:
Simona Kašterović, Silvia Ghilezan
Publikováno v:
Journal of Logic and Computation. 30:1567-1608
Full simply typed lambda calculus is the simply typed lambda calculus extended with product types and sum types. We propose a Kripke-style semantics for full simply typed lambda calculus. We then prove soundness and completeness of type assignment in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::697556dfe52b7949ab53588d02cd5390
https://doi.org/10.1093/logcom/exaa055
https://doi.org/10.1093/logcom/exaa055
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030399504
FoIKS
FoIKS
The 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 programmin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::158173cbe1858fcf12908735a57832ed
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783319720555
LFCS
LFCS
Reasoning with uncertainty has gained an important role in computer science, artificial intelligence and cognitive science. These applications urge for development of formal models which capture reasoning of probabilistic features. We propose a forma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e56cd40e2c829e0e0e26054213f23021