Sciweavers

918 search results - page 98 / 184
» Speculative Issue Logic
Sort
View
POPL
2004
ACM
16 years 6 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
WISE
2005
Springer
15 years 11 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
FPCA
1989
15 years 10 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
FLAIRS
2007
15 years 8 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
CIDR
2009
167views Algorithms» more  CIDR 2009»
15 years 7 months ago
Unbundling Transaction Services in the Cloud
The traditional architecture for a DBMS engine has the recovery, concurrency control and access method code tightly bound together in a storage engine for records. We propose a di...
David B. Lomet, Alan Fekete, Gerhard Weikum, Micha...