| Necula, G. Compiling with Proofs. Thesis Proposal, Carnegie Mellon University, Department of Computer Science, April 1997. |
....one dependent type can be assigned to a function without code duplication. Our primary motivation is to allow the programmer to express more program properties through types and thus catch more errors at compile time. We are also interested in using this as a front end for a certifying compiler [12] which propagates program properties through a compiler where they can be used for optimizations or be packaged with the binaries in the form of proof carrying code [13] 9 Acknowledgement We thank Peter Lee and George Necula for providing us with many interesting examples We also gratefully ....
Necula, G. Compiling with Proofs. Thesis Proposal, Carnegie Mellon University, Department of Computer Science, April 1997.
....one dependent type can be assigned to a function without code duplication. Our primary motivation is to allow the programmer to express more program properties through types and thus catch more errors at compile time. We are also interested in using this as a front end for a certifying compiler [11] which propagates program properties through a compiler where they can be used for optimizations or be packaged with the binaries in the form of proof carrying code [12] 7 Acknowledgement We gratefully acknowledge discussions with Rowan Davies, Peter Lee, and George Necula regarding the subject ....
Necula, G. Compiling with Proofs. Thesis Proposal, Carnegie Mellon University, Department of Computer Science, April 1997.
No context found.
Necula, G. Compiling with Proofs. Thesis Proposal, Carnegie Mellon University, Department of Computer Science, April 1997.
No context found.
Necula, G. Compiling with Proofs. Thesis Proposal, Carnegie Mellon University, Department of Computer Science, April 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC