736 search results - page 24 / 148 » High-order functions and their ordering relations |
ICALP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
120
click to vote
GLVLSI
1996
IEEE
15 years 1 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
VLSID
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a novel, non-simulative, probabilistic model for switching activity in sequential circuits, capturing both spatio-temporal correlations at internal nodes and higher ord...
159
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...