23 search results - page 2 / 5 » Proof-Theoretic Foundation of Compilation in Logic Programmi... |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
POPL
2012
ACM
12 years 29 days ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
LICS
1994
IEEE
13 years 9 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
ECEASST
2008
13 years 5 months ago
2008
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
COMPSAC
2009
IEEE
13 years 6 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...