.png){kind=icon}
.png){kind=icon}
Return
Towards type-directed compiler calculation
.png){kind=icon}
OA
AI
DOI：10.1017/S0956796825100087.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper explores a principled approach to calculating abstract machines and associated compilers, starting from an intrinsically typed interpreter. After deriving a compiler for a simple expression language in some detail, the first steps of this calculation are repeated to derive an optimizing evaluator for the simply typed lambda calculus.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
0.6
Papers:
8
Citations:
0
Organization
No organization information available