In this paper, we exploit higherorder abstract syntax (HOAS) to implement a type-preserving compiler for the simply-typed lambda-calculus.
Abstract. Compiling syntax to native code requires complex code trans- formations which rearrange the abstract syntax tree. This can be partic-.
When verifying that compiler phases preserve some property of the compiled program, a major difficulty lies in how to represent and manipulate variable ...
Jul 17, 2022 · I have access to it through my library and can say all the conference papers are in a single pdf with a paper per chapter.
Dec 2, 2015 · Scope and type safety of the code transformations are statically guaranteed, and our implementation nicely mirrors the paper proof of type ...
In this paper, we exploit higherorder abstract syntax (HOAS) to implement a type-preserving compiler for the simply-typed lambda-calculus, including ...
Abstract. Compiling syntax to native code requires complex code trans- formations which rearrange the abstract syntax tree. This can be partic-.
People also ask
What is a higher order abstraction?
When verifying that compiler phases preserve some property of the compiled program, a major difficulty lies in how to represent and manipulate variable ...
Programming type-safe transformations using higher-order abstract syntax. When verifying that compiler phases preserve some property of the compiled program ...
Jan 1, 2015 · Scope and type safety of the code transformations are statically guaranteed, and our implementation nicely mirrors the paper proof of type ...