## Specifications, Algorithms, Axiomatisations and Proofs Commented Case Studies (1995)

Venue: | In the Coq Proof Assistant”, Summer School on Logic of Computation |

Citations: | 1 - 0 self |

### BibTeX

@INPROCEEDINGS{Huet95specifications,algorithms,,

author = {Gérard Huet},

title = {Specifications, Algorithms, Axiomatisations and Proofs Commented Case Studies},

booktitle = {In the Coq Proof Assistant”, Summer School on Logic of Computation},

year = {1995}

}

### OpenURL

### Abstract

1.1 An overview of the specification language Gallina.................... 5

### Citations

921 | Categories for the working mathematician - Lane - 1998 |

163 | Inductive definitions in the system coq: Rules and properties - Paulin-Mohring - 1993 |

82 | An overview of the MIZAR project - Rudnicki - 1992 |

78 | IMPS: An interactive mathematical proof system - Farmer, Guttman, et al. - 1990 |

55 |
Computational category theory
- Rydeheard, Burstall
- 1988
(Show Context)
Citation Context ...s kind of mathematics, and we may thus hope to develop more sophisticated notions such as adjunction, which so far have been formally pursued only in extensional type theory[2]. Burstall and Rydeheard=-=[51]-=- have implemented a substantial number of concepts and constructions of category theory in SML (an ML dialect). The essential difference with our approach is that they do not include in their formalis... |

53 |
Synthesis of ML programs in system Coq
- Paulin-Mohring, Werner
- 1993
(Show Context)
Citation Context ...ing programs, insertion in AVL trees, transitive closure, shortest path in graphs, unification, etc. A tautology checker obtained by reduction to canonical forms of IF trees is described in detail in =-=[47]-=-. 73s74sBibliography [1] P. Aczel. “Galois: A Theory Development Project.” Turin workshop on the representation of mathematics in Logical Frameworks, January 1993. [2] J. A. Altucher and P. Panangaden... |

50 | The Coq proof assistant user's guide. Version 5.8 - Dowek, Felty, et al. - 1993 |

49 | A Higher-Order Implementation of Rewriting - Paulson - 1983 |

44 | Enhancing the Nuprl proof-development system and applying it to computational abstract algebra - Jackson - 1995 |

37 | A mechanical proof of the Church-Rosser theorem - Shankar - 1988 |

36 | A proof of the Church-Rosser theorem and its representation in a logical framework - Pfenning - 1992 |

27 | Residual theory in -calculus: A formal development - Huet - 1994 |

20 | Residual theory in λ-calculus: A formal development - Huet - 2013 |

17 | R'eductions correctes et optimales dans le -calcul. Th`ese de doctorat d'etat, Universit'e Paris VII - L'evy - 1978 |

14 |
Réductions correctes et optimales dans le λ-calcul. Thèse de doctorat d’état, Université Paris VII
- Lévy
- 1978
(Show Context)
Citation Context ...heorem. For every compatible sets of redexes U, V and W : V ⊂ U ⇒ W \U = (W \V )\(U\V ). The name “prism theorem” comes from the shape of the picture it evoques, in the same way that Lévy’s cube lemma=-=[42]-=- corresponds to the picture of a cube: W ✲ � � V � U � � � �✠ W \V ✲�✠ ❅ ❅ ❅❅❅❘ ❅❅❅❘ U\V ❄ ✲❄ W \U In our relational formalization, this theorem is expressed as the conjunction of prism1 and prism2. L... |

13 |
Elimination of extensionality in Martin-Löf type theory, in: Henk Barendregt, Tobias Nipkow (Eds
- Hofmann
- 1993
(Show Context)
Citation Context ... an equivalence relation over S. Thus a Setoid is a set considered as the quotient of a Type by a congruence. Setoids were first investigated by M. Hofmann in the framework of Martin-Löf’s type theory=-=[33]-=-. This terminology is due to R. Burstall. 4.2.1 The Setoid structure Structure Setoid : Type := {Carrier : Type; 36sEqual : (Relation Carrier); Prf_equiv : (Equivalence Equal)}. Let us understand what... |

10 | Induction principles formalized in the Calculus of Constructions - Huet - 1988 |

5 |
Category theory as an extension of Martin-Löf type theory
- Dyckhoff
- 1985
(Show Context)
Citation Context ...rloading mechanisms are obviously still lacking in order to implement the usual “abus de notation”. This logical reconstruction of the basics of category theory follows initial attempts by R. Dyckhoff=-=[25]-=- in Martin-Löf type theory. It shows that intentional type theory is sufficient for developing this kind of mathematics, and we may thus hope to develop more sophisticated notions such as adjunction, ... |

5 | The Gallina specification language : A case study - Huet - 1992 |

4 | Initiation `a la Th'eorie des Cat'egories - Huet - 1985 |

3 |
Mathematical Recreation column, Scientific
- Gardner
- 1960
(Show Context)
Citation Context ...es of Coq axiomatisations. 11s12sChapter 2 Shuffling cards 2.1 Introduction The first case study concerns a non-trivial property of binary sequences, inspired from a card trick due to Norman Gilbreath=-=[29, 27, 28, 12]-=-. The trick is based on a mathematical theorem concerning the shuffles of alternated binary words. A complete formalisation of the problem is given below. 2.2 Words We first axiomatize binary words, a... |

3 |
Type checking with universes. Theoretical computer science
- Harper
- 1991
(Show Context)
Citation Context ... analysis by Coquand[16] of paradoxes related to the category of categories. It is to be remarked that this example justifies the mechanism called “universe polymorphism” defined by Harper and Pollack=-=[32]-=-. That is, with universe polymorphism, we could directly define CAT as a Category, without having to make an explicit copy of the notion, the copying being done implicitly for each occurrence of the n... |

3 | Pure Type Systems Formalized.” To appear - McKinna, Pollack - 1993 |

3 |
Une axiomatisation constructive de la th'eorie des cat'egories." Rapport de Recherche, en pr'eparation
- Saibi
(Show Context)
Citation Context ...d interpretation includes the verification of predicate calculus conditions. The above axiomatisation may indeed be pursued to include a significant segment of category theory. Thus A. Saïbi shows in =-=[52]-=- how to define adjunction and limits, develops standard constructions such as defining limits from equalisers and products, and shows the existence of left adjunct functors under the conditions of Fre... |

3 | Constructive Computation Theory, Part I - Huet - 1992 |

2 |
Chapter 9, “New Mathematical Diversions from Scientific American.” George Allen and Unwin
- Gardner
- 1966
(Show Context)
Citation Context ...es of Coq axiomatisations. 11s12sChapter 2 Shuffling cards 2.1 Introduction The first case study concerns a non-trivial property of binary sequences, inspired from a card trick due to Norman Gilbreath=-=[29, 27, 28, 12]-=-. The trick is based on a mathematical theorem concerning the shuffles of alternated binary words. A complete formalisation of the problem is given below. 2.2 Words We first axiomatize binary words, a... |

2 |
Magnetic Colors.” The Linking
- Gilbreath
- 1959
(Show Context)
Citation Context ...es of Coq axiomatisations. 11s12sChapter 2 Shuffling cards 2.1 Introduction The first case study concerns a non-trivial property of binary sequences, inspired from a card trick due to Norman Gilbreath=-=[29, 27, 28, 12]-=-. The trick is based on a mathematical theorem concerning the shuffles of alternated binary words. A complete formalisation of the problem is given below. 2.2 Words We first axiomatize binary words, a... |

2 | Initiation `a la Th'eorie des Cat'egories. Notes de cours du DEA Fonctionnalit'e, Structures de Calcul et Programmation donn'e `a l'Universit'e Paris VII en 1983-84 et - Huet - 1984 |

2 |
Initiation à la calculabilité
- Huet
- 1988
(Show Context)
Citation Context ...ventions for partial operations: Commutation Theorem. If U1 and V1 (resp. U2 and V2) are compatible sets of redexes: (V1/U1)\(V2/U2) = (V1\V2)/(U1\U2) To our knowledge, this theorem appeared first in =-=[36]-=-. Remark that, despite its easy formulation, this theorem is not so intuitive. It is simple to say that residuals commute with substitution, but it is another matter to draw a diagram illustrating the... |

2 | Constructive Computation Theory - Huet - 1992 |

2 | The Coq Proof Assistant Version 5.10. A Tutorial. To appear as a technical report - Huet, Kahn, et al. - 1995 |

2 | Proof of Church-Rosser Theorem - Narayana - 1991 |

2 | Magnetic Colors." The Linking - Gilbreath - 1959 |

2 | Proofs and Types." Cambridge Tracts - Girard, Lafont - 1989 |

2 | Type checking with universes." Theoretical Computer Science 89 - Harper, Pollack - 1991 |

1 | Version 5.10 - Manual |

1 | Chapter 9, "New Mathematical Diversions from Scientific American." George Allen and Unwin - Gardner - 1966 |

1 | Edinburgh LCF." Springer-Verlag LNCS 78 - Gordon, Milner, et al. - 1979 |

1 | Initiation `a la calculabilit'e." Notes de Cours, DEA Universit'e Paris 7 - Huet - 1988 |

1 | Pure Type Systems Formalized." To appear - McKinna, Pollack - 1993 |

1 | Proof of Church-Rosser Theorem in Calculus of Constructions - Narayana - 1991 |