#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2003

2017

- This year (2)
- Last 5 years (8)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- François Pottier, Yann Régis-Gianas
- POPL
- 2006

Stratified type inference for generalized algebraic data types.

- Yann Régis-Gianas, François Pottier
- MPC
- 2008

We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style of Hindley and Milner. It is the theoretical basis for a tool that extracts proof obligations out of programs annotated with logical assertions. These proof obligations, expressed… (More)

- François Pottier, Yann Régis-Gianas
- Electr. Notes Theor. Comput. Sci.
- 2006

The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to produce parsers that are well-typed (so they cannot unexpectedly crash or fail) and nevertheless efficient. This is a… (More)

- Nicholas Ayache, Roberto M. Amadio, Yann Régis-Gianas
- FMICS
- 2012

We present a so-called labelling method to enrich a compiler in order to turn it into a “cost annotating compiler”, that is, a compiler which can lift pieces of information on the execution cost of the object code as cost annotations on the source code. These cost annotations characterize the execution costs of code fragments of constant complexity. The… (More)

Proof-by-reflection is a well-established technique that employs decision procedures to reduce the size of proof-terms. Currently, decision procedures can be written either in Type Theory—in a purely functional way that also ensures termination— or in an effectful programming language, where they are used as oracles for the certified checker. The first… (More)

- Roberto M. Amadio, Yann Régis-Gianas
- FOPARA
- 2011

We present a so-called labelling method to insert cost annotations in a higher-order functional program, to certify their correctness with respect to a standard compilation chain to assembly code, and to reason on them in a higher-order Hoare logic.

- Roberto M. Amadio, Nicholas Ayache, +12 authors Paolo Tranquilli
- FOPARA
- 2013

We provide an overview of the FET-Open Project CerCo (‘Certified Complexity’). Our main achievement is the development of a technique for analysing non-functional properties of programs (time, space) at the source level with little or no loss of accuracy and a small trusted code base. The core component is a C compiler, verified in Matita, that produces an… (More)

- Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch
- Theor. Comput. Sci.
- 2003

This paper reports on a new software platform called Vaucanson and dedicated to the computation with automata and transducers. Its main feature is the capacity of dealing with automata whose labels may belong to various algebraic structures. The paper successively describes the main features of the Vaucanson platform, including the fact that the very rich… (More)

The Vaucanson library works on weighted finite state machines in an algebraic framework. As computing tools, FSMs must provide efficient services. Yet, abstraction is needed to obtain genericity but also to define properly what objects we are working on. Even if parameterized classes are a known solution to this problem, the different kinds of algorithm… (More)

- Bruno Barras, Lourdes Del Carmen González-Huesca, +4 authors Burkhart Wolff
- MKM/Calculemus/DML
- 2013

Interactive theorem proving is a technology of fundamental importance for mathematics and computer-science. It is based on expressive logical foundations and implemented in a highly trustable way. Applications include huge mathematical proofs and semi-automated verifications of complex software systems. Interactive development of larger and larger proofs… (More)