Sciweavers

1202 search results - page 32 / 241
» Sortings for Reactive Systems
Sort
View
PLPV
2012
ACM
13 years 7 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 3 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
15 years 11 months ago
JouleSort: a balanced energy-efficiency benchmark
The energy efficiency of computer systems is an important concern in a variety of contexts. In data centers, reducing energy use improves operating cost, scalability, reliability,...
Suzanne Rivoire, Mehul A. Shah, Parthasarathy Rang...
TYPES
2007
Springer
15 years 5 months ago
Dependently Sorted Logic
Abstract. We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and withlity, retaining type dependency, but other...
João Filipe Belo
200
Voted
ICFP
2009
ACM
16 years 4 days ago
Safe functional reactive programming through dependent types
Functional Reactive Programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchr...
Neil Sculthorpe, Henrik Nilsson