POPL
2012
ACM
12 years 7 months ago
2012
ACM
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
PLPV
2012
ACM
12 years 7 months ago
2012
ACM
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 ...
PADL
2012
Springer
12 years 7 months ago
2012
Springer
An ad hoc data source is any semi-structured, non-standard data source. The format of such data sources is often evolving and frequently lacking documentation. Consequently, off-t...
PADL
2012
Springer
12 years 7 months ago
2012
Springer
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
PADL
2012
Springer
12 years 7 months ago
2012
Springer
We begin with a functional reactive programming (FRP) model in which every program is viewed as a signal function that converts a stream of input values into a stream of output va...
PADL
2012
Springer
12 years 7 months ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
ESOP
2012
Springer
12 years 7 months ago
2012
Springer
Abstract. MapReduce, being inspired by the map and reduce primitives available in many functional languages, is the de facto standard for large scale data-intensive parallel progra...
ESOP
2012
Springer
12 years 7 months ago
2012
Springer
Abstract. A behavioral contract in a higher-order language may invoke methods of unknown objects. Although this expressive power allows programmers to formulate sophisticated contr...
ESOP
2012
Springer
12 years 7 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
ESOP
2012
Springer
12 years 7 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...