Sciweavers

2000 search results - page 74 / 400
» Program Transformation and Proof Transformation
Sort
View
LFP
1992
153views more  LFP 1992»
15 years 1 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
CCS
2007
ACM
15 years 6 months ago
Program obfuscation: a quantitative approach
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
Bertrand Anckaert, Matias Madou, Bjorn De Sutter, ...
CC
2003
Springer
141views System Software» more  CC 2003»
15 years 5 months ago
A New One-Pass Transformation into Monadic Normal Form
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
Olivier Danvy
ADAEUROPE
2005
Springer
15 years 5 months ago
Extending Ravenscar with CSP Channels
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...
Diyaa-Addein Atiya, Steve King
ESOP
2004
Springer
15 years 5 months ago
Answer Type Polymorphism in Call-by-Name Continuation Passing
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...
Hayo Thielecke