fix library name and repo (#11)

Bool.lp

@@ -1,6 +1,6 @@
 /* Library on booleans. */
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop Blanqui.Lib.FOL Blanqui.Lib.Eq;
+require open Stdlib.Set Stdlib.Prop Stdlib.FOL Stdlib.Eq;
 
 inductive 𝔹 : TYPE ≔ // `dB or \BbbB
 | true : 𝔹

Comp.lp

@@ -2,8 +2,8 @@
 
 By Quentin Garchery (May 2021). */
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop Blanqui.Lib.FOL Blanqui.Lib.Eq
-  Blanqui.Lib.Bool;
+require open Stdlib.Set Stdlib.Prop Stdlib.FOL Stdlib.Eq
+  Stdlib.Bool;
 
 inductive Comp : TYPE ≔
 | Eq : Comp

Eq.lp

@@ -1,6 +1,6 @@
 // polymorphic Leibniz equality
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop;
+require open Stdlib.Set Stdlib.Prop;
 
 constant symbol = [a] : τ a → τ a → Prop;
 

FOL.lp

@@ -1,6 +1,6 @@
 // (multi-sorted) First-order logic
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop;
+require open Stdlib.Set Stdlib.Prop;
 
 // Universal quantification
 

List.lp

@@ -194,8 +194,8 @@ protected with nosimpl.
  An example of use can be found in fingraph theorem orbitPcycle.
 */
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop Blanqui.Lib.FOL Blanqui.Lib.Eq
-  Blanqui.Lib.Nat Blanqui.Lib.Bool;
+require open Stdlib.Set Stdlib.Prop Stdlib.FOL Stdlib.Eq
+  Stdlib.Nat Stdlib.Bool;
 
 (a:Set) inductive 𝕃:TYPE ≔
 | □ : 𝕃 a // \Box

Nat.lp

@@ -88,8 +88,8 @@ expnMn : (m1 * m2) ^ n = ... The operands of other operators are selected
 using the l/r suffixes.
 */
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop Blanqui.Lib.FOL Blanqui.Lib.Eq
-  Blanqui.Lib.Bool;
+require open Stdlib.Set Stdlib.Prop Stdlib.FOL Stdlib.Eq
+  Stdlib.Bool;
 
 inductive ℕ : TYPE ≔
 | 0 : ℕ

Pos.lp

@@ -2,8 +2,8 @@
 
 by Quentin Garchery (May 2021). */
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop Blanqui.Lib.FOL Blanqui.Lib.Eq
-  Blanqui.Lib.Nat Blanqui.Lib.Bool Blanqui.Lib.Comp;
+require open Stdlib.Set Stdlib.Prop Stdlib.FOL Stdlib.Eq
+  Stdlib.Nat Stdlib.Bool Stdlib.Comp;
 
 inductive ℙ : TYPE ≔
 | I : ℙ → ℙ

Z.lp

@@ -2,8 +2,8 @@
 
 by Quentin Garchery (May 2021). */
 
-require open Blanqui.Lib.Set Blanqui.Lib.Prop Blanqui.Lib.FOL Blanqui.Lib.Eq
-  Blanqui.Lib.Pos Blanqui.Lib.Bool;
+require open Stdlib.Set Stdlib.Prop Stdlib.FOL Stdlib.Eq
+  Stdlib.Pos Stdlib.Bool;
 
 inductive ℤ : TYPE ≔ // \BbbZ
 | Z0 : ℤ
@@ -349,7 +349,7 @@ end;
 
 // Comparison of integers
 
-require open Blanqui.Lib.Comp;
+require open Stdlib.Comp;
 
 symbol ≐ : ℤ → ℤ → Comp; notation ≐ infix 12; // \doteq
 

lambdapi-stdlib.opam

@@ -0,0 +1,28 @@
+opam-version: "2.0"
+synopsis: "Lambdapi library on natural numbers, integers and polymorphic lists"
+description: """
+This package provides a Lambdapi library on natural numbers,
+integers and polymorphic lists (in intuitionistic first-order logic).
+It provides the following modules:
+- Stdlib.Set: type of set codes
+- Stdlib.Prop: propositional logic
+- Stdlib.Eq: Leibniz equality
+- Stdlib.FOL: first-order logic
+- Stdlib.Bool: booleans
+- Stdlib.Nat: natural numbers
+- Stdlib.List: polymorphic lists
+- Stdlib.Comp: comparison result data type
+- Stdlib.Pos: binary positive numbers
+- Stdlib.Z: integers
+"""
+maintainer: ["frederic.blanqui@inria.fr"]
+authors: ["Frédéric Blanqui" "Quentin Buzet" "Quentin Garchery"]
+license: "CECILL-2.1"
+homepage: "https://github.com/Deducteam/lambdapi-stdlib"
+bug-reports: "https://github.com/Deducteam/lambdapi-stdlib/issues"
+dev-repo: "git+https://github.com/Deducteam/lambdapi-stdlib.git"
+install: [ make "install" ]
+uninstall: [ make "uninstall" ]
+depends: [
+  "lambdapi" {>= "2.3.0"}
+]

lambdapi.pkg

@@ -1,2 +1,2 @@
-package_name = blanqui-lib
-root_path = Blanqui.Lib
+package_name = stdlib
+root_path = Stdlib