394 search results - page 47 / 79 » Formal polytypic programs and proofs |
112
click to vote
ICFP
2000
ACM
15 years 8 months ago
2000
ACM
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...
113
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
124
click to vote
ADAEUROPE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The Ravenscar Profile is a restricted subset of the Ada tasking model, designed to meet the requirements of producing analysable and deterministic code. A central featur...
143
click to vote
FMICS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Safe is a first-order functional language with unusual memory management features: memory can be both explicitly and implicitly deallocated at some specific points in the...
149
Voted
NMR
2004
Springer
15 years 9 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...