2006 |
15 | | Jean-François Monin,
Judicaël Courant:
Proving termination using dependent types: the case of XOR-terms.
Trends in Functional Programming 2006: 1-18 |
2004 |
14 | EE | Jean-François Monin:
Proof Pearl: From Concrete to Functional Unparsing.
TPHOLs 2004: 217-224 |
2003 |
13 | | Béatrice Bérard,
Laurent Fribourg,
Francis Klay,
Jean-François Monin:
Compared Study of Two Correctness Proofs for the Standardized.
Formal Methods in System Design 22(1): 59-86 (2003) |
2000 |
12 | | Jean-François Monin:
Proving the Correctness of the Standardized Algorithm for ABR Conformance.
Formal Methods in System Design 17(3): 221-243 (2000) |
1999 |
11 | EE | Jean-François Monin,
Francis Klay:
Correctness Proof of the Standardized Algorithm for ABR Conformance.
World Congress on Formal Methods 1999: 662-681 |
1996 |
10 | | Jean-François Monin:
Proving a Real Time Algorithm for ATM in Coq.
TYPES 1996: 277-293 |
9 | | Jean-François Monin:
Exceptions Considered Harmless.
Sci. Comput. Program. 26(1-3): 179-196 (1996) |
1995 |
8 | | Jean-François Monin:
Extracting Programs with Exceptions in an Impredicative Type System.
MPC 1995: 335-350 |
1993 |
7 | | Guillaume Doumenc,
Jean-François Monin:
The Parallel Abstract Machine: A Common Execution Model for FDTs.
FME 1993: 285-293 |
1991 |
6 | | Jean-François Monin:
Real-size Compiler Writing Using Prolog with Arrows.
ICLP 1991: 188-201 |
1988 |
5 | | Jean-François Monin:
A Compiler Written in Prolog: The Véda Experience.
PLILP 1988: 119-131 |
4 | EE | Claude Jard,
Jean-François Monin,
Roland Groz:
Development of Véda, a Prototyping Tool for Distributed Algorithms.
IEEE Trans. Software Eng. 14(3): 339-352 (1988) |
1987 |
3 | | Jean-François Monin,
E. Barrielle:
Est-ce que Prolog sait lire?
SPLT 1987: 131-140 |
1985 |
2 | | Claude Jard,
Jean-François Monin,
Roland Groz:
Experience in implementing ESTELLE-X.250 (a CCITT subset of ESTELLE) in VEDA.
PSTV 1985: 315-331 |
1984 |
1 | | Jean-François Monin:
Ecriture d'un compilateur "réel" en PROLOG.
SPLT 1984 |