Sciweavers

Share
ESOP
2016
Springer
3 years 9 months ago
Probabilistic NetKAT
This paper develops a new language for programming softwaredefined networks based on a probabilistic semantics. We extend the NetKAT language with new primitives for expressing p...
Nate Foster, Dexter Kozen, Konstantinos Mamouras, ...
ESOP
2016
Springer
3 years 9 months ago
Automatically Splitting a Two-Stage Lambda Calculus
Abstract. Staged programming languages assign a stage to each program expression and evaluate each expression in its assigned stage. A common use of staged languages is to describe...
Nicolas Feltman, Carlo Angiuli, Umut A. Acar, Kayv...
ESOP
2016
Springer
3 years 9 months ago
Coordinated Concurrent Programming in Syndicate
Most programs interact with the world: via graphical user interfaces, networks, etc. This form of interactivity entails concurrency, and concurrent program components must coordina...
Tony Garnock-Jones, Matthias Felleisen
ESOP
2016
Springer
3 years 9 months ago
Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
This paper presents a shallow embedding of a probabilistic functional programming language in higher order logic. The language features monadic sequencing, recursion, random sampli...
Andreas Lochbihler
ESOP
2016
Springer
3 years 9 months ago
Computing with Semirings and Weak Rig Groupoids
Abstract. The original formulation of the Curry–Howard correspondence relates propositional logic to the simply-typed λ-calculus at three levels: the syntax of propositions corr...
Jacques Carette, Amr Sabry
ESOP
2016
Springer
3 years 9 months ago
Practical Optional Types for Clojure
Typed Clojure is an optional type system for Clojure, a dynamic language in the Lisp family that targets the JVM. Typed Clojure’s type system build on the design of Typed Racket...
Ambrose Bonnaire-Sergeant, Rowan Davies, Sam Tobin...
ESOP
2016
Springer
3 years 9 months ago
A Classical Realizability Model for a Semantical Value Restriction
We present a new type system with support for proofs of programs in a call-by-value language with control operators. The proof mechanism relies on observational equivalence of (unt...
Rodolphe Lepigre
ESOP
2016
Springer
3 years 9 months ago
An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs
Abstract. This paper addresses the problem of proving a given invariance property ϕ of a loop in a numeric program, by inferring automatically a stronger inductive invariant ψ. T...
Antoine Miné, Jason Breck, Thomas W. Reps
books