54 search results - page 9 / 11 » Proving operational termination of membership equational pro... |
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
ISCI
2007
13 years 7 months ago
2007
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...