797 search results - page 4 / 160 » Eliminating Proofs from Programs |
115
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
116
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
IPL
2008
15 years 23 days ago
2008
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
95
Voted
JLP
2008
15 years 23 days ago
2008
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
112
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...