#### Filter Results:

#### Publication Year

1981

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Matthieu Sozeau, Nicolas Oury
- TPHOLs
- 2008

Type Classes have met a large success in Haskell and Is-abelle, as a solution for sharing notations by overloading and for specifying with abstract structures by quantification on contexts. However, both systems are limited by second-class implementations of these constructs , and these limitations are only overcomed by ad-hoc extensions to the respective… (More)

- Nicolas Oury, Wouter Swierstra
- ICFP
- 2008

This paper exhibits the power of programming with dependent types by dint of embedding three domain-specific languages: Cryptol, a language for cryptographic protocols; a small data description language; and relational algebra. Each example demonstrates particular design patterns inherent to dependently-typed programming. Documenting these techniques paves… (More)

- Nicolas Oury
- TPHOLs
- 2005

This paper presents a method to translate a proof in an ex-tensional version of the Calculus of Constructions into a proof in the Calculus of Inductive Constructions extended with a few axioms. We use a specific equality in order to translate the extensional conversion relation into an intensional system.

- Nicolas Oury, Gordon D. Plotkin
- Mathematical Structures in Computer Science
- 2013

We present a simple stochastic rule-based approach to multilevel modelling for computational systems biology. Populations are modelled using multilevel multisets; these contain both species and agents, with the latter possibly containing further such multisets. Rules are pairs of such multisets, but now allowing variables to occur (as well as species and… (More)

- Ohad Kammar, Sam Lindley, Nicolas Oury
- ICFP
- 2013

Plotkin and Pretnar's handlers for algebraic effects occupy a sweet spot in the design space of abstractions for effectful computation. By separating effect signatures from their implementation, algebraic effects provide a high degree of modularity, allowing programmers to express effectful programs independently of the concrete interpretation of their… (More)

- Vincent Danos, Nicolas Oury
- Mathematical Structures in Computer Science
- 2013

This paper is concerned with the asymptotic properties of a restricted class of Petri nets equipped with stochastic mass action semantics. We establish a simple algebraic criterion for the existence of an equilibrium, that is to say an invariant probability that satisfies the detailed balance condition familiar from the thermodynamics of reaction networks.… (More)

The recent success of languages like Agda and Coq demonstrates the potential of using dependent types for programming. These systems rely on many high level features like datatype definitions, pattern matching and implicit arguments to facilitate the use of the language. However, these features complicate the metatheoretical study and are a potential source… (More)

We introduce ΠΣ, a core language for dependently typed programming. Our intention is that ΠΣ should play the role extensions of System F are playing for conventional functional languages with polymorphism, like Haskell. The core language incorporates mutual dependent recursive definitions, Type : Type, Π-and Σ-types, finite sets of labels and explicit… (More)

- Vincent Danos, Nicolas Oury
- DCM
- 2010

We present a reduction of the Turing halting problem (in the simplified form of the Post correspondence problem) to the problem of whether a continuous-time Markov chain (CTMC) presented as a set of Kappa graph-rewriting rules has an equilibrium. It follows that the problem of whether a computable CTMC is dissipative (ie does not have an equilibrium) is… (More)

- Nicolas Oury
- TLCA
- 2003