222 search results - page 2 / 45 » Subject Reduction of Logic Programs as Proof-Theoretic Prope... |
ESOP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
79
Voted
CAP
2010
14 years 6 months ago
2010
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
101
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
PLDI
2012
ACM
13 years 1 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
82
Voted
GPCE
2008
Springer
15 years 16 days ago
2008
Springer
A user interface, such as a dialog, assists a user in synthesising a set of values, typically parameters for a command object. Code for “command parameter synthesis” is usuall...