Hyperintensions as Computations

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985955%3A_____%2F25%3A00641309" target="_blank" >RIV/67985955:_____/25:00641309 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s10992-025-09809-3" target="_blank" >https://doi.org/10.1007/s10992-025-09809-3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10992-025-09809-3" target="_blank" >10.1007/s10992-025-09809-3</a>

Result language
angličtina
Original language name
Hyperintensions as Computations
Original language description
In this paper, we show that the hyperintensional typed lambda calculus (HTLC) of Fait and Primiero (Journal of Applied Logics IfCoLog Journal of Logics and their Applications, 8(2), 469-495, 2021) inspired by transparent intensional logic is equivalent to the computational lambda calculus (CLC) of Moggi (Information and Computation, 93(1), 55-92, 1991) extended by a simple axiom. We demonstrate this by first establishing a link between HTLC and propositional lax logic (PLL) which corresponds to CLC via the Curry-Howard isomorphism. Our result puts on solid formal ground a long-held assumption that there is a close connection between the notions of structured hyperintension and computation.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
60301 - Philosophy, History and Philosophy of science and technology

Project
<a href="/en/project/GM21-23610M" target="_blank" >GM21-23610M: Logical Structure of Information Channels</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)