Sciweavers

351 search results - page 24 / 71
» Logic Programs with Compiled Preferences
Sort
View
POPL
2002
ACM
14 years 9 months ago
Towards automatic construction of staged compilers
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
Matthai Philipose, Craig Chambers, Susan J. Eggers
EPIA
2007
Springer
14 years 2 months ago
Modelling Morality with Prospective Logic
This paper shows how moral decisions can be drawn computationally by using prospective logic programs. These are employed to model moral dilemmas, as they are able to prospectively...
Luís Moniz Pereira, Ari Saptawijaya
CADE
2008
Springer
14 years 9 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann
PLDI
2003
ACM
14 years 1 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
ICLP
2003
Springer
14 years 1 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...