Sciweavers

351 search results - page 17 / 71
» Logic Programs with Compiled Preferences
Sort
View
ICLP
1995
Springer
14 years 5 days ago
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...
COLING
1992
13 years 9 months ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson
TPHOL
2007
IEEE
14 years 2 months ago
Separation Logic for Small-Step cminor
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
Andrew W. Appel, Sandrine Blazy
ISCA
1999
IEEE
105views Hardware» more  ISCA 1999»
14 years 27 days ago
The Program Decision Logic Approach to Predicated Execution
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
David I. August, John W. Sias, Jean-Michel Puiatti...
HASKELL
2009
ACM
14 years 3 months ago
The architecture of the Utrecht Haskell compiler
In this paper we describe the architecture of the Utrecht Haskell Compiler (UHC). UHC is a new Haskell compiler, that supports most (but not all) Haskell 98 features, plus some ex...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra