Sciweavers

1710 search results - page 167 / 342
» High-Level Programs and Program Conditions
Sort
View
ICFP
2009
ACM
14 years 9 months ago
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
Tiark Rompf, Ingo Maier, Martin Odersky
POPL
2009
ACM
14 years 9 months ago
Unifying type checking and property checking for low-level code
We present a unified approach to type checking and property checking for low-level code. Type checking for low-level code is challenging because type safety often depends on compl...
Jeremy Condit, Brian Hackett, Shuvendu K. Lahiri, ...
FOSSACS
2010
Springer
14 years 3 months ago
Completeness for Algebraic Theories of Local State
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
Sam Staton
EUROGP
2007
Springer
104views Optimization» more  EUROGP 2007»
14 years 2 months ago
Code Regulation in Open Ended Evolution
We explore a homeostatic approach to program execution in computer systems: the “concentration” of computation services is regulated according to their fitness. The goal is to...
Lidia Yamamoto
CC
2005
Springer
120views System Software» more  CC 2005»
14 years 1 months ago
Data Slicing: Separating the Heap into Independent Regions
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
Jeremy Condit, George C. Necula