797 search results - page 45 / 160 » Eliminating Proofs from Programs |
APAL
2005
15 years 19 days ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
88
Voted
CG
2004
Springer
15 years 17 days ago
2004
Springer
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
128
Voted
PEPM
2000
ACM
15 years 4 months ago
2000
ACM
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
CAV
2010
Springer
15 years 4 months ago
2010
Springer
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
129
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we present type systems for flow-sensitive pointer analysis, live stack-heap (variables) analysis, and program optimization. The type system for live stack-heap ana...