Theoretical Foundation of Typechecking algorithm for Equi-Recursive Types
发布于 2022-01-21
Theoretical Foundation of Typechecking Algorithm for Equi-Recursi …
We Choose to Go to the Moon
Dylech30th的阅读笔记
Theoretical Foundation of Typechecking Algorithm for Equi-Recursi …
Strong Normalization of Simply Typed Lambda Calculus From the ( …
Preliminaries The Typing Relation A term t belongs to type T me …
The syntax of Church’s lambda calculus can be described by BNF: ̷
\cfrac{premise}{conclusion} is called inference rule, it stands f …
本文中用P_n表示P[1..n],用P[n]表示P中的第n个字符,用P_i\sqsupset P_q代表P_i是P_q的后缀,用P …
Minsky’s Theorem A two-pushdown stack machine, abbr. 2PDA, is a P ̷
Three-address code The compilers do not treat the part of the pro …
Post Machines A particular “universal computing machine” is int