A Few Notes on Lambda-Computation and TIL-Construction (21st Conference Applications of Logic in Philosophy and the Foundations of Mathematics, Szklarska Poręba, 10. 5. 2016)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14210%2F16%3A00087923" target="_blank" >RIV/00216224:14210/16:00087923 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
A Few Notes on Lambda-Computation and TIL-Construction (21st Conference Applications of Logic in Philosophy and the Foundations of Mathematics, Szklarska Poręba, 10. 5. 2016)
Original language description
Lambda calculus (abbr. LC) originally developed by (Church, 1932) can be regarded as the most universal tool for expressing computations (Turing, 1937). Its fundamental computation rule, so called beta-reduction, is defined in terms of substitution and it embodies the idea of function application. Consequently, each application of beta-reduction rule can be regarded as a single computational step. There is, however, at least one formal system utilizing lambda calculus in which these correspondences (roughly put, computational step = beta-reduction = function application) do not hold. It is called transparent intensional logic (abbr. TIL) and it was developed by (Tichý, 1988). I will, however, focus on one of its later variants found in (Duží, Jespersen, Materna, 2010). In the present talk I will examine this deviation from standard lambda calculus and explore the outcomes it entails for the corresponding system.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA16-19395S" target="_blank" >GA16-19395S: Semantic notions, paradoxes and hyperintensional logic based on modern ramified theory of types</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)