351 search results - page 55 / 71 » Logic Programs with Compiled Preferences |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
FCCM
2000
IEEE
13 years 12 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...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
POPL
2007
ACM
14 years 7 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...
VMCAI
2004
Springer
14 years 25 days ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...