Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
Anthony Discolo, Tim Harris, Simon Marlow, Simon L...
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
Functional reactive programming integrates dynamic dataflow with functional programming to offer an elegant and powerful model for expressing computations over time-varying values....
Daniel Ignatoff, Gregory H. Cooper, Shriram Krishn...
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...
We describe the design and implementation of a trust-management system Soutei, a dialect of Binder, for access control in distributed systems. Soutei policies and credentials are w...
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
Gilles Barthe, Julien Forest, David Pichardie, Vla...