N.G. de Bruijn. "A riffle shuffle card trick and its relation to quasi crystal theory." Nieuw Archief Voor Wiskunde 5 3 (1987) 285--301. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Specifications, Algorithms, Axiomatisations and Proofs - Commented .. - Huet (1995) (1 citation) (Correct)
....of Inductive Constructions. We shall see in the rest of the course a few typical examples of Coq axiomatisations. 11 12 Chapter 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, an inductive structure isomorphic to Boolean lists: Inductive word : Set : empty : word ....
N.G. de Bruijn. "A riffle shuffle card trick and its relation to quasi crystal theory." Nieuw Archief Voor Wiskunde 5 3 (1987) 285--301.
Specifications, Algorithms, Axiomatisations and Proofs - Commented .. - Huet (1995) (1 citation) (Correct)
....of Inductive Constructions. We shall see in the rest of the course a few typical examples of Coq axiomatisations. 11 12 Chapter 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, an inductive structure isomorphic to Boolean lists: Inductive word : Set : empty : word ....
N.G. de Bruijn. "A riffle shuffle card trick and its relation to quasi crystal theory." Nieuw Archief Voor Wiskunde 5 3 (1987) 285--301.
Axiomatisations, Proofs, and Formal Specifications of Algorithms.. - Huet (Correct)
....of the Calculus of Inductive Constructions. We shall see in the rest of the course a few typical examples of Coq axiomatisations. 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[12, 11, 4]. 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, an inductive structure isomorphic to Boolean lists: 5 Inductive word : Set : empty : word ....
N.G. de Bruijn. "A riffle shuffle card trick and its relation to quasi crystal theory." Nieuw Archief Voor Wiskunde 5 3 (1987) 285--301.
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