RACLAVSKÝ, Jiří. Beta-reduction and parciality. In Computational Logic, FI MU (Brno). 2014.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Beta-reduction and parciality
Name in Czech Početní pravidlo beta-redukce a parcialita
Authors RACLAVSKÝ, Jiří (203 Czech Republic, guarantor, belonging to the institution).
Edition Computational Logic, FI MU (Brno), 2014.
Other information
Original language English
Type of outcome Presentations at conferences
Field of Study 60300 6.3 Philosophy, Ethics and Religion
Country of publisher Czech Republic
Confidentiality degree is not subject to a state or trade secret
Organization unit Faculty of Arts
Keywords in English lambda-calculus; beta-reduction; partiality
Changed by Changed by: prof. PhDr. BcA. Jiří Raclavský, Ph.D., učo 7593. Changed: 19/6/2020 12:20.
Abstract
After an introduction to lambda calculus, in which beta-reduction is the main rule, we focus on the problems raised in partiality adopted in the framework. We will show behaviour of various kinds of beta-reduction and investigate the so-called conditionalized beta-reduction.
Abstract (in Czech)
Po lehkém úvodu do lambda-kalkulu, v němž je beta-redukce základním početním pravidlem (tj. [lambda (...x...) t] = (...t/x...) ), se zaměříme na potíže, které vzniknou, když do systému přijmeme parcialitu. Ukážeme si chování několika druhů beta-redukcí a přikloníme se k tzv. conditionalized beta-redukci.
Links
CZ.1.07/2.2.00/28.0216, interní kód MUName: Logika: systémový rámec rozvoje oboru v ČR a koncepce logických propedeutik pro mezioborová studia (Acronym: logika-ramec-rozvoje)
Investor: Ministry of Education, Youth and Sports of the CR, 2.2 Higher education
PrintDisplayed: 12/9/2024 20:24