73 search results - page 13 / 15 » plp: A Generic Compiler for Ordered Logic Programs |
161
click to vote
FCCM
2000
IEEE
15 years 10 months ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
149
Voted
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
272
Voted
POPL
2007
ACM
16 years 5 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
197
click to vote
SIGSOFT
2006
ACM
15 years 11 months ago
2006
ACM
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
213
click to vote
ESOP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...