E. Gimenez. Un calcul de constructions infinies et son application a la verification de systemes communicants. PhD thesis, Ecole Normale Superieure de Lyon, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Full Formalisation of π-Calculus Theory in the Calculus of .. - Hirschkoff (1997) (1 citation) (Correct)
....cases, a structural induction can be performed on the process resulting from the transition, a technique that also avoids the introduction of circularity in our proofs. It should be of interest to study how these restrictions on the shape of our proofs evolve when working with coinductive types [Gim96]. We first prove congruence, stated as follows: Theorem 4.1 (Congruence) is a congruence relation with respect to constructors j, and . To obtain congruence for all operators of calculus, we must consider relation , defined by: P Q iff for all substitution oe, P oe Qoe . We then ....
....has described in [Mil92] another interesting point of view onto calculus specification by the means of a translation into linear logic that allows one to define some testing equivalences for a subclass of processes. Finally, let us mention as well Gim enez work in Coq on coinductive types [Gim96], which includes an implementation of CBS; we only used coinductive types in a toy example, to prove that our notion of bisimulation coincides with a formulation in terms of a greatest fix point of a combinator (using the fact that a coinductive definition implicitly implements a greatest ....
E. Gim'enez. Un calcul de constructions infinies et son application `a la v'erification de syst`emes communicants. PhD thesis, E.N.S. Lyon, 1996.
Dependently Typed Functional Programs and their Proofs - McBride (1999) (17 citations) (Correct)
....elimination operator, following a suggestion from Thierry Coquand: they now divide elimination into a Case analysis operator and a constructor guarded Fix point operator. Eduardo Gimenez s conservativity argument [Gim94] is bolstered by a strong normalisation proof for the case of lists [Gim96] he has recently proved strong normalisation for the general case [Gim98] Bruno Barras has formalised much of the metathory for this system [Bar99] including the decidability of typechecking. This Case Fix separation is a sensible one, and it makes practical the technology in this ....
....Working interactively, we do not need to predict so precisely in advance the inductive structure you require. Eduardo Gimenez showed the conservativity and confluence of Case and Fix in [Gim94] He showed strong normalisation for the Calculus of Constructions extended with lists in this style [Gim96], and there seems no reason to suppose this does not extend to other types. Intuitively, reductions make a sound like the clanking of a giant metal cog in a ratchet. However deeply under skyscraping storeys of fi and ffi administration the real work may be buried, we can still hear the great ....
E. Gimenez. Un Calcul de Constructions Infinies et son Application a la Verification de Systemes Communicants. Doctoral Thesis. ENS Lyon. 1996.
Analysis of a Guard Condition in Type Theory - Amadio, Coupet-Grimal (1997) (8 citations) (Correct)
....ffl Recursive definitions of infinite objects are restricted so that consideration of partial elements is not needed. Thus this work differs from work on the representation of infinite structures in lazy programming languages like Haskell (see, e.g. Tho96] In his thesis, Gimenez [Gim96] has carried on a realization of Coquand s programme in the framework of the calculus of constructions [CH88] More precisely, he studies a calculus of constructions extended with a type of streams (i.e. finite and infinite lists) and proves subject reduction and strong normalization for a ....
....RC of reducibility candidates if: C 1 ) X SN (C 2 ) If M 2 X and M M 0 then M 0 2 X. C 3 ) If M is neutral and 8M 0 (M M 0 ) M 0 2 X) then M 2 X. The following are standard properties of reducibility candidates (but for (P 5 ) and (P 6 ) which mutatis mutandis appear in [Gim96]) Proposition 18 The set RC enjoys the following properties: P 1 ) SN 2 RC . P 2 ) If X 2 RC then x 2 X. Hence X 6= P 3 ) If X;Y 2 RC then X Y = fM j 8N 2 X (MN 2 Y )g 2 RC : P 4 ) If 8 i 2 I X i 2 RC then T i2I X i 2 RC . P 5 ) If X 2 RC then N (X) fM j 8Y 2 RC 8P 2 SN X ....
E. Gimenez. Un calcul de constructions infinies et son application `a la v'erification de syst`emes communicants. PhD thesis, ENS Lyon, 1996.
Practical Inference for Typed-Based Termination in a.. - Barthe, Gregoire.. (Correct)
No context found.
E. Gimenez. Un calcul de constructions infinies et son application a la verification de systemes communicants. PhD thesis, Ecole Normale Superieure de Lyon, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC