diff options
author | letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2011-05-05 15:12:09 +0000 |
---|---|---|
committer | letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2011-05-05 15:12:09 +0000 |
commit | f61a557fbbdb89a4c24a8050a67252c3ecda6ea7 (patch) | |
tree | 3808b3b5a9fc4a380307545e10845882300ef6aa /theories | |
parent | 81d7335ba1a07a7a30e206ae3ffc4412f3a54f46 (diff) |
Definitions of positive, N, Z moved in Numbers/BinNums.v
In the coming reorganisation, the name Z in BinInt will be a
module containing all code and properties about binary integers.
The inductive type Z hence cannot be at the same location.
Same for N and positive. Apart for this naming constraint, it
also have advantages : presenting the three types at once is
clearer, and we will be able to refer to N in BinPos (for instance
for output type of a predecessor function on positive).
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@14097 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories')
-rw-r--r-- | theories/NArith/BinNat.v | 34 | ||||
-rw-r--r-- | theories/NArith/NArith.v | 1 | ||||
-rw-r--r-- | theories/Numbers/BinNums.v | 61 | ||||
-rw-r--r-- | theories/Numbers/vo.itarget | 1 | ||||
-rw-r--r-- | theories/PArith/BinPos.v | 40 | ||||
-rw-r--r-- | theories/PArith/PArith.v | 2 | ||||
-rw-r--r-- | theories/ZArith/BinInt.v | 38 | ||||
-rw-r--r-- | theories/ZArith/ZArith_base.v | 1 |
8 files changed, 114 insertions, 64 deletions
diff --git a/theories/NArith/BinNat.v b/theories/NArith/BinNat.v index 3f256b40f..3e576a08b 100644 --- a/theories/NArith/BinNat.v +++ b/theories/NArith/BinNat.v @@ -6,33 +6,18 @@ (* * GNU Lesser General Public License Version 2.1 *) (************************************************************************) +Require Export BinNums. Require Import BinPos. (**********************************************************************) -(** Binary natural numbers *) - -Inductive N : Set := - | N0 : N - | Npos : positive -> N. - -(** Declare binding key for scope positive_scope *) - -Delimit Scope N_scope with N. - -(** Automatically open scope positive_scope for the constructors of N *) +(** * Binary natural numbers, operations and properties *) +(**********************************************************************) -Bind Scope N_scope with N. -Arguments Scope Npos [positive_scope]. +(** The type [N] and its constructors [N0] and [Npos] are now + defined in [BinNums.v] *) Local Open Scope N_scope. -(** Some local ad-hoc notation, since no interpretation of numerical - constants is available yet. *) - -Local Notation "0" := N0 : N_scope. -Local Notation "1" := (Npos 1) : N_scope. -Local Notation "2" := (Npos 2) : N_scope. - Definition Ndiscr : forall n:N, { p:positive | n = Npos p } + { n = N0 }. Proof. destruct n; auto. @@ -693,3 +678,12 @@ Proof. intros (m,H). now destruct m. exists 0. reflexivity. Qed. + +(** Compatibility notations *) + +Notation N := N (only parsing). +Notation N_rect := N_rect (only parsing). +Notation N_rec := N_rec (only parsing). +Notation N_ind := N_ind (only parsing). +Notation N0 := N0 (only parsing). +Notation Npos := Npos (only parsing). diff --git a/theories/NArith/NArith.v b/theories/NArith/NArith.v index 22c9012a7..6bfc323d6 100644 --- a/theories/NArith/NArith.v +++ b/theories/NArith/NArith.v @@ -8,6 +8,7 @@ (** Library for binary natural numbers *) +Require Export BinNums. Require Export BinPos. Require Export BinNat. Require Export Nnat. diff --git a/theories/Numbers/BinNums.v b/theories/Numbers/BinNums.v new file mode 100644 index 000000000..69754f144 --- /dev/null +++ b/theories/Numbers/BinNums.v @@ -0,0 +1,61 @@ +(************************************************************************) +(* v * The Coq Proof Assistant / The Coq Development Team *) +(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2010 *) +(* \VV/ **************************************************************) +(* // * This file is distributed under the terms of the *) +(* * GNU Lesser General Public License Version 2.1 *) +(************************************************************************) + +(** * Binary Numerical Datatypes *) + +Set Implicit Arguments. +(* For compatibility, we will not use generic equality functions *) +Local Unset Boolean Equality Schemes. + +Declare ML Module "z_syntax_plugin". + +(** [positive] is a datatype representing the strictly positive integers + in a binary way. Starting from 1 (represented by [xH]), one can + add a new least significant digit via [xO] (digit 0) or [xI] (digit 1). + Numbers in [positive] can also be denoted using a decimal notation; + e.g. [6%positive] abbreviates [xO (xI xH)] *) + +Inductive positive : Set := + | xI : positive -> positive + | xO : positive -> positive + | xH : positive. + +Delimit Scope positive_scope with positive. +Bind Scope positive_scope with positive. +Arguments Scope xO [positive_scope]. +Arguments Scope xI [positive_scope]. + +(** [N] is a datatype representing natural numbers in a binary way, + by extending the [positive] datatype with a zero. + Numbers in [N] can also be denoted using a decimal notation; + e.g. [6%N] abbreviates [Npos (xO (xI xH))] *) + +Inductive N : Set := + | N0 : N + | Npos : positive -> N. + +Delimit Scope N_scope with N. +Bind Scope N_scope with N. +Arguments Scope Npos [positive_scope]. + +(** [Z] is a datatype representing the integers in a binary way. + An integer is either zero or a strictly positive number + (coded as a [positive]) or a strictly negative number + (whose opposite is stored as a [positive] value). + Numbers in [Z] can also be denoted using a decimal notation; + e.g. [(-6)%Z] abbreviates [Zneg (xO (xI xH))] *) + +Inductive Z : Set := + | Z0 : Z + | Zpos : positive -> Z + | Zneg : positive -> Z. + +Delimit Scope Z_scope with Z. +Bind Scope Z_scope with Z. +Arguments Scope Zpos [positive_scope]. +Arguments Scope Zneg [positive_scope]. diff --git a/theories/Numbers/vo.itarget b/theories/Numbers/vo.itarget index baefbd252..c69af03fc 100644 --- a/theories/Numbers/vo.itarget +++ b/theories/Numbers/vo.itarget @@ -1,3 +1,4 @@ +BinNums.vo BigNumPrelude.vo Cyclic/Abstract/CyclicAxioms.vo Cyclic/Abstract/NZCyclic.vo diff --git a/theories/PArith/BinPos.v b/theories/PArith/BinPos.v index ec18d8dc5..badae225f 100644 --- a/theories/PArith/BinPos.v +++ b/theories/PArith/BinPos.v @@ -7,32 +7,20 @@ (* * GNU Lesser General Public License Version 2.1 *) (************************************************************************) -Declare ML Module "z_syntax_plugin". +Require Export BinNums. (**********************************************************************) -(** * Binary positive numbers *) +(** * Binary positive numbers, operations and properties *) (**********************************************************************) (** Initial development by Pierre Crégut, CNET, Lannion, France *) -Inductive positive : Set := -| xI : positive -> positive -| xO : positive -> positive -| xH : positive. - -(** Declare binding key for scope positive_scope *) - -Delimit Scope positive_scope with positive. - -(** Automatically open scope positive_scope for type positive, xO and xI *) - -Bind Scope positive_scope with positive. -Arguments Scope xO [positive_scope]. -Arguments Scope xI [positive_scope]. +(** The type [positive] and its constructors [xI] and [xO] and [xH] + are now defined in [BinNums.v] *) (** Postfix notation for positive numbers, allowing to mimic the position of bits in a big-endian representation. - For instance, we can write 1~1~0 instead of (xO (xI xH)) + For instance, we can write [1~1~0] instead of [(xO (xI xH))] for the number 6 (which is 110 in binary notation). *) @@ -42,12 +30,8 @@ Notation "p ~ 0" := (xO p) (at level 7, left associativity, format "p '~' '0'") : positive_scope. Local Open Scope positive_scope. - -(* In the current file, [xH] cannot yet be written as [1], since the - interpretation of positive numerical constants is not available - yet. We fix this here with an ad-hoc temporary notation. *) - -Local Notation "1" := xH (at level 7). +Local Unset Boolean Equality Schemes. +Local Unset Case Analysis Schemes. (**********************************************************************) (** * Operations over positive numbers *) @@ -1599,3 +1583,13 @@ Proof. apply Pmult_le_mono_l. apply Ple_lteq; left. rewrite xI_succ_xO. apply Plt_succ_r, IHp. Qed. + +(** Compatibility notations *) + +Notation positive := positive (only parsing). +Notation positive_rect := positive_rect (only parsing). +Notation positive_rec := positive_rec (only parsing). +Notation positive_ind := positive_ind (only parsing). +Notation xI := xI (only parsing). +Notation xO := xO (only parsing). +Notation xH := xH (only parsing). diff --git a/theories/PArith/PArith.v b/theories/PArith/PArith.v index 8688c5013..e2bec88af 100644 --- a/theories/PArith/PArith.v +++ b/theories/PArith/PArith.v @@ -8,4 +8,4 @@ (** Library for positive natural numbers *) -Require Export BinPos Pnat Pminmax Psqrt Pgcd POrderedType. +Require Export BinNums BinPos Pnat Pminmax Psqrt Pgcd POrderedType. diff --git a/theories/ZArith/BinInt.v b/theories/ZArith/BinInt.v index ad3781832..6e5443e35 100644 --- a/theories/ZArith/BinInt.v +++ b/theories/ZArith/BinInt.v @@ -7,25 +7,19 @@ (* * GNU Lesser General Public License Version 2.1 *) (************************************************************************) +Require Export BinNums BinPos Pnat. +Require Import BinNat Plus Mult. + (***********************************************************) (** * Binary Integers *) -(** Initial author: Pierre Crégut, CNET, Lannion, France *) (***********************************************************) -Require Export BinPos Pnat. -Require Import BinNat Plus Mult. - -Inductive Z : Set := - | Z0 : Z - | Zpos : positive -> Z - | Zneg : positive -> Z. +(** Initial author: Pierre Crégut, CNET, Lannion, France *) +(** The type [Z] and its constructors [Z0] and [Zpos] and [Zneg] + are now defined in [BinNums.v] *) -(** Automatically open scope positive_scope for the constructors of Z *) -Delimit Scope Z_scope with Z. -Bind Scope Z_scope with Z. -Arguments Scope Zpos [positive_scope]. -Arguments Scope Zneg [positive_scope]. +Local Open Scope Z_scope. (*************************************) (** * Basic operations *) @@ -53,8 +47,6 @@ Definition Zdouble (x:Z) := | Zneg p => Zneg p~0 end. -Open Local Scope positive_scope. - Fixpoint ZPminus (x y:positive) {struct y} : Z := match x, y with | p~1, q~1 => Zdouble (ZPminus p q) @@ -66,9 +58,7 @@ Fixpoint ZPminus (x y:positive) {struct y} : Z := | 1, q~1 => Zneg q~0 | 1, q~0 => Zneg (Pdouble_minus_one q) | 1, 1 => Z0 - end. - -Close Local Scope positive_scope. + end%positive. (** ** Addition on integers *) @@ -191,8 +181,6 @@ Definition Zplus' (x y:Z) := | Zneg x', Zneg y' => Zneg (x' + y') end. -Open Local Scope Z_scope. - (**********************************************************************) (** ** Inductive specification of Z *) @@ -1050,3 +1038,13 @@ Definition Z_of_N (x:N) := | N0 => Z0 | Npos p => Zpos p end. + +(** Compatibility Notations *) + +Notation Z := Z (only parsing). +Notation Z_rect := Z_rect (only parsing). +Notation Z_rec := Z_rec (only parsing). +Notation Z_ind := Z_ind (only parsing). +Notation Z0 := Z0 (only parsing). +Notation Zpos := Zpos (only parsing). +Notation Zneg := Zneg (only parsing). diff --git a/theories/ZArith/ZArith_base.v b/theories/ZArith/ZArith_base.v index 10a071c80..05df86880 100644 --- a/theories/ZArith/ZArith_base.v +++ b/theories/ZArith/ZArith_base.v @@ -10,6 +10,7 @@ These are the basic modules, required by [Omega] and [Ring] for instance. The full library is [ZArith]. *) +Require Export BinNums. Require Export BinPos. Require Export BinNat. Require Export BinInt. |