Sciweavers

1781 search results - page 91 / 357
» Functional Answer Set Programming
Sort
View
154
Voted
STACS
2012
Springer
14 years 1 days ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
ICFP
2008
ACM
16 years 4 months ago
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
Bruno C. D. S. Oliveira, Jeremy Gibbons
MICRO
1994
IEEE
85views Hardware» more  MICRO 1994»
15 years 8 months ago
A high-performance microarchitecture with hardware-programmable functional units
This paper explores a novel way to incorporate hardware-programmable resources into a processor microarchitecture to improve the performance of general-purpose applications. Throu...
Rahul Razdan, Michael D. Smith
PLDI
2005
ACM
15 years 10 months ago
Checking type safety of foreign function calls
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
Michael Furr, Jeffrey S. Foster
ASP
2005
Springer
15 years 10 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre