Extensible Proof-Producing Compilation-Reference-Cited by-同舟云学术

Extensible Proof-Producing Compilation

Published:2009 Issue: Volume: Page:2-16
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Myreen Magnus O.,Slind Konrad,Gordon Michael J. C.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00722-4_2

Reference22 articles.

1. The Netwide Assembler, http://www.nasm.us/

2. The GNU Project. GCC, the GNU Compiler Collection, http://gcc.gnu.org/

3. Benton, N., Zarfaty, U.: Formalizing and verifying semantic type soundness of a simple compiler. In: Leuschel, M., Podelski, A. (eds.) Principles and Practice of Declarative Programming (PPDP), pp. 1–12. ACM, New York (2007)

4. Cheney, C.J.: A non-recursive list compacting algorithm. Commun. ACM 13(11), 677–678 (1970)

5. Chlipala, A.J.: A certified type-preserving compiler from lambda calculus to assembly language. In: Programming Language Design and Implementation (PLDI), pp. 54–65. ACM, New York (2007)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Relational compilation for performance-critical applications: extensible proof-producing translation of functional models into low-level code;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

2. Proof-producing translation of higher-order logic into pure and stateful ML;Journal of Functional Programming;2014-01-20

3. CakeML;ACM SIGPLAN Notices;2014-01-13

4. CakeML;Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2014-01-08

5. Proof-producing synthesis of ML from higher-order logic;ACM SIGPLAN Notices;2012-10-15