more random stuff
This commit is contained in:
parent
1d83564d3b
commit
4afedcaf4a
12
coq/ensemble-demo.v
Normal file
12
coq/ensemble-demo.v
Normal file
@ -0,0 +1,12 @@
|
||||
Require Import Ensembles.
|
||||
Require Import Powerset.
|
||||
|
||||
Declare Scope ens_scope.
|
||||
Delimit Scope ens_scope with ens.
|
||||
Infix "⊂" := Included (at level 50).
|
||||
Infix "∈" := In (at level 40).
|
||||
Infix "∪" := Union (at level 40).
|
||||
Infix "∩" := Intersection (at level 40).
|
||||
Notation "∅" := Empty_set.
|
||||
|
||||
Notation "'P(' A ')" := (Power_set A).
|
18
coq/list-set/eins.v
Normal file
18
coq/list-set/eins.v
Normal file
@ -0,0 +1,18 @@
|
||||
(* Require Import List ssreflect. *)
|
||||
(* Import ListNotations. *)
|
||||
|
||||
From mathcomp Require Import seq ssreflect.
|
||||
|
||||
Section Foo.
|
||||
Context {A: Type}.
|
||||
Context (beq: A -> A -> bool).
|
||||
|
||||
Search (list _ -> _ -> nat).
|
||||
|
||||
Definition onlyonce (l: list A) (a: A): Prop :=
|
||||
match
|
||||
Definition unique (l: list A): Prop :=
|
||||
match l with
|
||||
|
||||
Definition set {A: Type} (l: list A)
|
||||
End Foo.
|
67
coq/list-to-vec.v
Normal file
67
coq/list-to-vec.v
Normal file
@ -0,0 +1,67 @@
|
||||
Require Import List Vector.
|
||||
Import ListNotations.
|
||||
|
||||
Require Import Extraction.
|
||||
Extraction Language Haskell.
|
||||
|
||||
Example lst1 := [1;2;3].
|
||||
Example vec1 := Eval compute in (of_list lst1).
|
||||
Recursive Extraction vec1.
|
||||
|
||||
(*
|
||||
data Nat =
|
||||
O
|
||||
| S Nat
|
||||
|
||||
data T a =
|
||||
Nil
|
||||
| Cons a Nat (T a)
|
||||
|
||||
vec1 :: T Nat
|
||||
vec1 =
|
||||
Cons (S O) (S (S O)) (Cons (S (S O)) (S O) (Cons (S (S (S O))) O Nil))
|
||||
#+END_OUTPUT (Info) *)
|
||||
|
||||
Require Import Vector.
|
||||
Import VectorNotations.
|
||||
|
||||
(* Extract Inductive nat => "Int" [ "0" "(+1)"]. *)
|
||||
Extract Inductive nat => "Int" [ "0" "succ"]
|
||||
"(\fO fS n -> if n == 0 then fO () else fS (n - 1))".
|
||||
|
||||
Example vec := [true].
|
||||
Recursive Extraction vec.
|
||||
(*
|
||||
data T a =
|
||||
Nil
|
||||
| Cons a Int (T a)
|
||||
|
||||
vec :: T Bool
|
||||
vec =
|
||||
Cons True 0 Nil
|
||||
*)
|
||||
|
||||
Require Import Fin.
|
||||
Print Fin.t.
|
||||
(*
|
||||
Inductive t : nat -> Set :=
|
||||
| F1 : forall n : nat, t (S n)
|
||||
| FS : forall n : nat, t n -> t (S n).
|
||||
*)
|
||||
Check F1: Fin.t 2.
|
||||
Check FS F1.
|
||||
Example f1: Fin.t 2 := FS F1.
|
||||
Recursive Extraction f1.
|
||||
(*
|
||||
data T =
|
||||
F1 Int
|
||||
| FS Int T
|
||||
|
||||
f1 :: T
|
||||
f1 =
|
||||
FS (succ 0) (F1 0)
|
||||
*)
|
||||
|
||||
Inductive myFin : nat -> Set :=
|
||||
| F1: myFin 1
|
||||
| FS: forall n: nat, myFin n -> myFin (S n).
|
78
coq/mathcomp/coqeal-hello.v
Normal file
78
coq/mathcomp/coqeal-hello.v
Normal file
@ -0,0 +1,78 @@
|
||||
(* https://coq.zulipchat.com/#narrow/stream/237664-math-comp-users/topic/coqeal.20example *)
|
||||
|
||||
|
||||
From mathcomp Require Import ssreflect ssrfun ssrbool eqtype.
|
||||
From mathcomp Require Import ssralg matrix ssrint.
|
||||
From mathcomp Require Import all_algebra all_ssreflect.
|
||||
|
||||
Local Open Scope ring_scope.
|
||||
|
||||
Definition M2 : 'M[bool]_(2,2) := \matrix_(i,j < 2) 0.
|
||||
Example zeromat: 'M[bool]_2 := 0.
|
||||
|
||||
From CoqEAL Require Import hrel param refinements trivial_seq.
|
||||
From CoqEAL Require Import binnat binint seqpoly binord seqmx.
|
||||
|
||||
|
||||
|
||||
Goal ((0 : 'M[int]_(2,2)) == 0).
|
||||
by coqeal.
|
||||
Qed.
|
||||
|
||||
|
||||
Check (M2 1 1).
|
||||
|
||||
Check mulmx.
|
||||
|
||||
From CoqEAL Require Import strassen.
|
||||
Check Strassen.
|
||||
(*
|
||||
#+BEGIN_OUTPUT (Info)
|
||||
Strassen
|
||||
: forall R : ringType,
|
||||
positive ->
|
||||
forall p : positive,
|
||||
'M_(ssrnat.nat_of_pos p) ->
|
||||
'M_(ssrnat.nat_of_pos p) -> 'M_(ssrnat.nat_of_pos p)
|
||||
#+END_OUTPUT (Info) *)
|
||||
Check mulmx.
|
||||
(*
|
||||
#+BEGIN_OUTPUT (Info)
|
||||
mulmx
|
||||
: 'M_(?m, ?n) -> 'M_(?n, ?p) -> 'M_(?m, ?p)
|
||||
where
|
||||
?R : [ |- ringType]
|
||||
?m : [ |- nat]
|
||||
?n : [ |- nat]
|
||||
?p : [ |- nat]
|
||||
#+END_OUTPUT (Info) *)
|
||||
|
||||
Search (matrix -> seq).
|
||||
|
||||
Print seqmx.
|
||||
Definition seqmx_of_mx {A: Type} {rows cols: nat}
|
||||
(M : 'M[A]_(rows,cols)) : seqmx := [seq [seq M i j | j <- enum 'I_cols] | i <- enum 'I_rows].
|
||||
|
||||
Example M2' := Eval lazy in (seqmx_of_mx M2).
|
||||
Require Import Extraction.
|
||||
Print hseqmx.
|
||||
Print seqmx.
|
||||
Extraction M2'.
|
||||
Extraction seqmx_of_mx.
|
||||
Extraction M2'.
|
||||
|
||||
Goal
|
||||
(0: 'M[bool]_3) 2 1 == true.
|
||||
Proof.
|
||||
rewrite //=.
|
||||
rewrite Rseqmx_0.
|
||||
|
||||
Goal
|
||||
M2 1 2 == 0.
|
||||
Proof.
|
||||
Check Rseqmx_0.
|
||||
|
||||
rewrite -Rseqmx_0.
|
||||
rewrite Rseqmx_0.
|
||||
|
||||
|
29
coq/mathcomp/mathcomp2/hb-fintype.v
Normal file
29
coq/mathcomp/mathcomp2/hb-fintype.v
Normal file
@ -0,0 +1,29 @@
|
||||
From HB Require Import structures.
|
||||
From mathcomp Require Import all_ssreflect all_algebra.
|
||||
|
||||
Require Import Extraction.
|
||||
Extraction Language Haskell.
|
||||
|
||||
Variable A: finType.
|
||||
HB.about enum.
|
||||
HB.check enum.
|
||||
Recursive Extraction (enum A).
|
||||
|
||||
HB.about eqType.
|
||||
Check eqP.
|
||||
Check eq_op.
|
||||
|
||||
HB.about finType.
|
||||
HB.about enumP_subdef.
|
||||
Check enumP_subdef.
|
||||
|
||||
About finType.
|
||||
About Finite.type.
|
||||
HB.about Finite.type.
|
||||
Fail HB.about finType.
|
||||
Fail HB.about isFinite.
|
||||
Fail HB.about Finite.
|
||||
Fail Fail About isFinite.
|
||||
HB.about isFinite.Build.
|
||||
Check isFinite.
|
||||
HB.about IsFinite.
|
52
coq/mathcomp/rel_fun.v
Normal file
52
coq/mathcomp/rel_fun.v
Normal file
@ -0,0 +1,52 @@
|
||||
From mathcomp Require Import all_ssreflect.
|
||||
Set Bullet Behavior "Strict Subproofs".
|
||||
|
||||
|
||||
Print rel.
|
||||
(*
|
||||
rel = fun T : Type => T -> pred T
|
||||
: Type -> Type
|
||||
*)
|
||||
Print pred.
|
||||
(*
|
||||
pred = fun T : Type => T -> bool
|
||||
: Type -> Type
|
||||
*)
|
||||
|
||||
Search rel set_of.
|
||||
|
||||
Section Foo.
|
||||
Context {T: finType} (a b: T).
|
||||
Context (R: rel T) (X: {set T}).
|
||||
|
||||
Definition funify := [set y | x in X, y in T & R x y].
|
||||
|
||||
Goal forall x y: T,
|
||||
x \in X ->
|
||||
y \in funify ->
|
||||
R x y.
|
||||
Proof.
|
||||
move => x y.
|
||||
rewrite /funify.
|
||||
rewrite /=.
|
||||
(* Search rel set_of. *)
|
||||
Abort.
|
||||
|
||||
Goal forall x y: T,
|
||||
R x y ->
|
||||
x \in X ->
|
||||
y \in funify.
|
||||
Proof.
|
||||
rewrite /funify /= => x y.
|
||||
Abort.
|
||||
|
||||
|
||||
|
||||
Check R a b.
|
||||
Check [set y in [set: T]].
|
||||
(* Check [finType of bool]. *)
|
||||
Check equivalence_partition.
|
||||
Check equivalence_partition R [set a]: {set {set T}}.
|
||||
(* Search equivalence_partition. *)
|
||||
Check [set b] \in equivalence_partition R [set a].
|
||||
End Foo.
|
37
coq/ohe-sep-proof.v
Normal file
37
coq/ohe-sep-proof.v
Normal file
@ -0,0 +1,37 @@
|
||||
(* https://coq.zulipchat.com/#narrow/stream/237977-Coq-users/topic/Proving.20equality.20of.20a.20dependent.20type *)
|
||||
|
||||
Require Import List.
|
||||
Import ListNotations.
|
||||
|
||||
(* Mark and Pad *)
|
||||
Inductive mp: Type := Mark | Pad.
|
||||
|
||||
(* Check count_occ. *)
|
||||
(* Check eq_dec. *)
|
||||
(* Locate "{ _ = _ } + { _ <> _ }". *)
|
||||
(* Search bool "{_ = }". *)
|
||||
(* Search (list _ -> _ -> nat). *)
|
||||
|
||||
(*
|
||||
countMark l = 1
|
||||
length l = n
|
||||
*)
|
||||
Fixpoint countMark (l: list mp): nat :=
|
||||
match l with
|
||||
| nil => 0
|
||||
| Mark :: l' => S (countMark l')
|
||||
| _ :: l' => countMark l'
|
||||
end.
|
||||
|
||||
(* Definition t (n: nat) (l: list mp) := *)
|
||||
(* length l = n -> *)
|
||||
(* countMark l = 1 -> *)
|
||||
(* Type. *)
|
||||
(* Check []: t 0. *)
|
||||
|
||||
Definition t (n: nat) := forall (l: list mp),
|
||||
length l = n ->
|
||||
countMark l = 1 ->
|
||||
Type.
|
||||
|
||||
Check []: t 0.
|
122
coq/one-hot.v
Normal file
122
coq/one-hot.v
Normal file
@ -0,0 +1,122 @@
|
||||
Require Import ssreflect.
|
||||
|
||||
(*
|
||||
Requirements:
|
||||
- Exactly one mark
|
||||
- Fixed size
|
||||
- No zero size
|
||||
*)
|
||||
|
||||
Require Import Fin.
|
||||
Print Fin.t.
|
||||
(*
|
||||
Inductive t : nat -> Set :=
|
||||
| F1 : forall n : nat, t (S n)
|
||||
| FS : forall n : nat, t n -> t (S n).
|
||||
*)
|
||||
|
||||
Goal
|
||||
Fin.t 0 -> False.
|
||||
Proof.
|
||||
intro H.
|
||||
inversion H.
|
||||
Qed.
|
||||
|
||||
(* Indices: size and a flag indicating whether the mark has been made *)
|
||||
Inductive t: nat -> bool -> Type :=
|
||||
| Mark: forall {n: nat},
|
||||
t n false -> t (S n) true
|
||||
| Pad: forall {n:nat} {b: bool},
|
||||
t n b -> t (S n) b
|
||||
| Nil: forall {n:nat} {b:bool},
|
||||
t (S n) b.
|
||||
|
||||
Lemma t0False: forall (b: bool),
|
||||
t 0 b -> False.
|
||||
Proof.
|
||||
move => b H.
|
||||
inversion H.
|
||||
Qed.
|
||||
|
||||
Fixpoint markCount {n:nat} {b:bool} (a: t n b): nat :=
|
||||
match a with
|
||||
| Mark a' => S (markCount a')
|
||||
| Pad a' => markCount a'
|
||||
| Nil => 1
|
||||
end.
|
||||
|
||||
Goal forall (n:nat) (b: bool) (a: t n b),
|
||||
markCount a = 1.
|
||||
Proof.
|
||||
move => n b a.
|
||||
elim: n b a.
|
||||
- move => b a.
|
||||
have H := t0False _ a.
|
||||
inversion H.
|
||||
- elim.
|
||||
+ move => IHn b a.
|
||||
|
||||
apply: t0False _ a.
|
||||
by rewrite (t0False _ a).
|
||||
|
||||
|
||||
(* Inductive t: nat -> bool -> Type := *)
|
||||
(* | Mark: forall {n: nat}, *)
|
||||
(* t n false -> t (S n) true *)
|
||||
(* | Pad: forall {n:nat} {b: bool}, *)
|
||||
(* t n b -> t (S n) b *)
|
||||
(* | Zero: t 1 false *)
|
||||
(* | One: t 1 true. *)
|
||||
|
||||
Fixpoint markCount {n:nat} {b:bool} (a: t n b): nat :=
|
||||
match a with
|
||||
| Mark a' => S (markCount a')
|
||||
| Pad a' => markCount a'
|
||||
| Zero => O
|
||||
| One => 1
|
||||
end.
|
||||
|
||||
Require Import Fin.
|
||||
Print Fin.t.
|
||||
Goal forall (b: bool),
|
||||
t 0 b -> False.
|
||||
Proof.
|
||||
move => b a.
|
||||
case a eqn:Hcase.
|
||||
Restart.
|
||||
case.
|
||||
- elim.
|
||||
+ by [].
|
||||
+ by [].
|
||||
+
|
||||
|
||||
move => b a.
|
||||
case b.
|
||||
Restart.
|
||||
move => b.
|
||||
elim.
|
||||
- by [].
|
||||
- by [].
|
||||
-
|
||||
(*
|
||||
b : bool
|
||||
|
||||
========================= (1 / 1)
|
||||
|
||||
False
|
||||
*)
|
||||
|
||||
Goal forall (n:nat) (b: bool) (a: t n b),
|
||||
markCount a = 1.
|
||||
Proof.
|
||||
move => a n b.
|
||||
elim: a n b.
|
||||
- move => n a.
|
||||
|
||||
|
||||
Check One.
|
||||
Check Zero.
|
||||
Check Mark Zero.
|
||||
Check Pad (Mark Zero).
|
||||
Check Pad (Mark Zero).
|
||||
(* Notation "[ x ; .. ; y ]" := (cons x .. (cons y nil) ..). *)
|
103
coq/re-thompson/re.v
Normal file
103
coq/re-thompson/re.v
Normal file
@ -0,0 +1,103 @@
|
||||
Require Import List.
|
||||
Import ListNotations.
|
||||
|
||||
Section Setify.
|
||||
Context {A:Type}.
|
||||
Variable (A_eqb: A -> A -> bool).
|
||||
|
||||
(* x ∈ l *)
|
||||
Definition elementOf (x: A) (l: list A): bool :=
|
||||
List.existsb (fun a => A_eqb x a) l.
|
||||
|
||||
(* By the way, this function is a good example to illustrate
|
||||
the difference between foldl and foldr... *)
|
||||
Definition setify (l: list A): list A :=
|
||||
List.fold_left (fun acc x =>
|
||||
if elementOf x acc then acc
|
||||
else (List.cons x acc)
|
||||
) l List.nil.
|
||||
|
||||
|
||||
(* Not caring about efficiency here... *)
|
||||
Definition union (a b: list A): list A :=
|
||||
let aset := setify a in
|
||||
List.fold_left (fun acc y =>
|
||||
if elementOf y acc then acc
|
||||
else (List.cons y acc)
|
||||
) b aset.
|
||||
End Setify.
|
||||
|
||||
Inductive re {A:Type}: Type :=
|
||||
| ε: re
|
||||
| Char: A -> re
|
||||
| Cat: re -> re -> re
|
||||
| Alt: re -> re -> re
|
||||
| Star: re -> re.
|
||||
Arguments re: clear implicits.
|
||||
|
||||
Module ReNotations.
|
||||
Notation "'↑' a" := (Char a) (at level 10).
|
||||
Notation "r '∗'" := (Star r) (at level 20).
|
||||
Infix ";" := Cat (at level 60, right associativity).
|
||||
Infix "│" := Cat (at level 65, right associativity).
|
||||
End ReNotations.
|
||||
|
||||
Inductive instr {A:Type}: Type :=
|
||||
| Atom: A -> instr
|
||||
| Fork: instr -> instr -> instr
|
||||
| Jump: instr -> instr
|
||||
| Halt: instr.
|
||||
Arguments instr: clear implicits.
|
||||
|
||||
Section Foo.
|
||||
Context {A:Type}.
|
||||
Variable (A_eqb: A -> A -> bool).
|
||||
|
||||
Fixpoint getStates_aux (r: re A): list A :=
|
||||
match r with
|
||||
| Char a => [a]
|
||||
| Alt r1 r2 | Cat r1 r2 =>
|
||||
(getStates_aux r1) ++ (getStates_aux r2)
|
||||
| Star rr => getStates_aux rr
|
||||
| ε => []
|
||||
end.
|
||||
Definition getStates (r: re A): list A :=
|
||||
setify A_eqb (getStates_aux r).
|
||||
End Foo.
|
||||
|
||||
|
||||
(*
|
||||
Fail Fixpoint compile {A:Type} (r: re A)
|
||||
(k: list (instr A)): list (instr A) :=
|
||||
match r with
|
||||
| Char a => (Chr a) :: k
|
||||
| Cat r1 r2 => compile r1 (compile r2 k)
|
||||
| Alt r1 r2 => [Fork (compile r1 k) (compile r2 k)]
|
||||
| Star rr =>
|
||||
Fork k (compile rr (Star rr))
|
||||
| ε => [Halt]
|
||||
end.
|
||||
|
||||
|
||||
Fail Fixpoint compile {A:Type} (r k: re A): list (instr A) :=
|
||||
match r with
|
||||
| Char a => (Chr a) :: (compile k ε)
|
||||
| Cat r1 r2 => [Halt]
|
||||
| Alt r1 r2 => [Halt]
|
||||
| Star rr => [Halt]
|
||||
| ε => [Halt]
|
||||
end.
|
||||
*)
|
||||
|
||||
Import ReNotations.
|
||||
Require Import String.
|
||||
Open Scope string.
|
||||
|
||||
Example r1 := (↑"a" ; ↑"b" ; ε).
|
||||
Example r2 := (↑0 ; ↑1 ; ε).
|
||||
|
||||
Unset Printing Notations.
|
||||
Print r1.
|
||||
Set Printing Notations.
|
||||
|
||||
Compute getStates Nat.eqb r2.
|
184
coq/strict-positive.v
Normal file
184
coq/strict-positive.v
Normal file
@ -0,0 +1,184 @@
|
||||
Inductive re {A:Type}: Type :=
|
||||
| Char: A -> re
|
||||
| Cat: re -> re -> re
|
||||
| Alt: re -> re -> re
|
||||
| Star: re -> re.
|
||||
Arguments re: clear implicits.
|
||||
|
||||
Inductive t {A res k:Type}: Type :=
|
||||
| B (a:A) (kt kf:k)
|
||||
| H (v:res)
|
||||
| F (kt kf:k)
|
||||
| L (def: k -> t) (body:t)
|
||||
| R (def body: k -> t).
|
||||
Arguments t: clear implicits.
|
||||
Check B 0 (H true) (H false).
|
||||
|
||||
Require Import Program.
|
||||
Fixpoint compile {A k:Type}
|
||||
(r: re A) (kt kf:k): t A bool k :=
|
||||
match r with
|
||||
| Char a => B a kt kf
|
||||
| Cat r1 r2 =>
|
||||
L (fun p2 => compile r1 p2 kf) (compile r2 kt kf)
|
||||
| Alt r1 r2 =>
|
||||
L (fun p1 =>
|
||||
L (fun p2 => F p1 p2)
|
||||
(compile r2 kt kf))
|
||||
(compile r1 kt kf)
|
||||
| Star rr =>
|
||||
R (fun k => _)
|
||||
(fun k => _)
|
||||
end.
|
||||
|
||||
Compute compile (Cat (Char 0) (Char 1)) (H true) (H false).
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
Require Import Program.
|
||||
Fixpoint compile {A k:Type}
|
||||
(r: re A) (kt kf:k): t A bool k :=
|
||||
match r with
|
||||
| Char a => B a kt kf
|
||||
| Cat r1 r2 =>
|
||||
let k2 := compile r2 kt kf in
|
||||
compile r1 kt kf
|
||||
| Alt r1 r2 => H true
|
||||
| Star rr => H true
|
||||
end.
|
||||
|
||||
Compute compile (Cat (Char 0) (Char 1)) (H true) (H false).
|
||||
|
||||
|
||||
Section Foo.
|
||||
Context {A res A1 A2 res1 res2 k:Type}.
|
||||
Axiom unnest: t A _ (t _ res _) -> t A res k.
|
||||
End Foo.
|
||||
Check unnest (B 0 (H true) (H false)).
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
(*
|
||||
sk := B a
|
||||
| Fork
|
||||
| Jump
|
||||
| Fix (* kt can be the loop body and kf the real kt *)
|
||||
*)
|
||||
Inductive re {A:Type}: Type :=
|
||||
| Char: A -> re
|
||||
| Cat: re -> re -> re
|
||||
| Alt: re -> re -> re
|
||||
| Star: re -> re.
|
||||
Arguments re: clear implicits.
|
||||
|
||||
(*
|
||||
Inductive sk {K:Type}: Type :=
|
||||
| B: forall {A:Type} (kt kf:K), A -> sk
|
||||
| F: forall kt kf:K, sk
|
||||
| J: forall kt kf:K, sk
|
||||
| M: forall kt kf:K, sk
|
||||
| H: bool -> sk.
|
||||
Arguments sk: clear implicits.
|
||||
*)
|
||||
|
||||
Inductive sk: Type :=
|
||||
| B: forall {A:Type}, A -> sk -> sk -> sk
|
||||
| F: sk -> sk -> sk
|
||||
| J: sk -> sk
|
||||
| M: sk -> sk -> sk
|
||||
| H: bool -> sk.
|
||||
Arguments sk: clear implicits.
|
||||
|
||||
Check B.
|
||||
Check M.
|
||||
Check H true.
|
||||
Check B 0 (H true) (H false).
|
||||
|
||||
|
||||
Fixpoint compile {A:Type} (r:re A) (kt kf:sk): sk :=
|
||||
match r with
|
||||
| Char a => B a kt kf
|
||||
| Cat r1 r2 =>
|
||||
let k2 := compile r2 kt kf in
|
||||
compile r1 k2 kf
|
||||
| Alt r1 r2 =>
|
||||
F (compile r1 kt kf) (compile r2 kt kf)
|
||||
| Star rr =>
|
||||
M (compile rr kt kf)
|
||||
end.
|
||||
Compute compile (Cat (Char 0) (Char 1)) (H true) (H false).
|
||||
Compute compile (Alt (Char 0) (Char 1)) (H true) (H false).
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
Inductive sk {A K:Type}: K -> K -> Type :=
|
||||
| B: forall kt kf:K, A -> sk kt kf
|
||||
| F: forall kt kf:K, sk kt kf
|
||||
| J: forall kt kf:K, sk kt kf
|
||||
| M: forall kt kf:K, sk kt kf.
|
||||
| H: forall kt kf:K, sk kt kf.
|
||||
Arguments sk: clear implicits.
|
||||
|
||||
Check B.
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
Inductive lbl {V:Type}: Type :=
|
||||
| Lbl: (V -> lbl -> lbl -> lbl) -> lbl.
|
||||
Arguments lbl: clear implicits.
|
||||
|
||||
Inductive t (V:Type): Type :=
|
||||
| Nil: t V
|
||||
| Two: t V -> t V -> t V
|
||||
| Con: (V -> t V) -> t V.
|
||||
Arguments Nil {V}.
|
||||
Arguments Two {V}.
|
||||
Arguments Con {V}.
|
||||
|
||||
Check Con (fun _:unit => Nil).
|
||||
Check Con (V:=t unit) (fun x=> Two x Nil).
|
||||
Check Con.
|
||||
Check Con (fun x=>x).
|
55
coq/third-party/hb-fintype.v
vendored
Normal file
55
coq/third-party/hb-fintype.v
vendored
Normal file
@ -0,0 +1,55 @@
|
||||
From mathcomp Require Import all_ssreflect.
|
||||
From HB Require Import structures.
|
||||
|
||||
(* From mathcomp Require Import seq. *)
|
||||
Require Import List.
|
||||
Import ListNotations.
|
||||
|
||||
Inductive foo: Type :=
|
||||
| Foo0 | Foo1 | Foo2.
|
||||
|
||||
|
||||
Check pcan_type.
|
||||
Check pcancel.
|
||||
(*
|
||||
(As in rT is a bigger type than aT)
|
||||
|
||||
pcancel : forall rT aT : Type, (aT -> rT) -> (rT -> option aT) -> Prop
|
||||
*)
|
||||
|
||||
Module fooHB.
|
||||
Definition enum_subdef: list foo := [Foo0; Foo1; Foo2].
|
||||
End fooHB.
|
||||
HB.about Finite.
|
||||
HB.about isFinite.
|
||||
HB.about isFinite.Build.
|
||||
HB.about IsEqType.
|
||||
HB.about isEqType.Build.
|
||||
(*
|
||||
#+BEGIN_OUTPUT (Info)
|
||||
HB: isFinite.Build is a factory constructor (from "./fintype.v", line 161)
|
||||
|
||||
HB: isFinite.Build requires its subject to be already equipped with:
|
||||
- hasDecEq
|
||||
|
||||
HB: isFinite.Build provides the following mixins:
|
||||
- isFinite
|
||||
|
||||
HB: arguments: isFinite.Build T [enum_subdef] enumP_subdef
|
||||
- T : Type
|
||||
- enum_subdef : seq.seq T
|
||||
- enumP_subdef :
|
||||
Finite.axiom
|
||||
(T:={|
|
||||
Equality.sort := T;
|
||||
Equality.class :=
|
||||
{| Equality.eqtype_hasDecEq_mixin := Finite.class T |}
|
||||
|}) enum_subdef
|
||||
#+END_OUTPUT (Info) *)
|
||||
HB.about enumP_subdef.
|
||||
Check enumP_subdef.
|
||||
Check enum_subdef. (* [Foo0; Foo1] *)
|
||||
Check enumP_subdef. (* [Foo0; Foo1] *)
|
||||
Print Finite.axiom.
|
||||
Print finite_axiom.
|
||||
Fail HB.instance Definition foo_fin := isFinite.Build foo fooHB.enum_subdef _.
|
33
coq/type-checker-atkey.v
Normal file
33
coq/type-checker-atkey.v
Normal file
@ -0,0 +1,33 @@
|
||||
Require Import List.
|
||||
Import ListNotations.
|
||||
|
||||
(* Inductive ref {A: Type}: A -> list A -> Type := *)
|
||||
(* | Here: forall (a:A) (ls:list A), *)
|
||||
(* ref a (a::ls) *)
|
||||
(* | Further: forall {a: A} {ls: list A} (x: A), *)
|
||||
(* ref a ls -> ref a (x::ls). *)
|
||||
|
||||
Inductive type: Type :=
|
||||
| Nat | Bool
|
||||
| Arrow: type -> type -> type.
|
||||
|
||||
(* Inductive ctxt: list type -> Type := *)
|
||||
(* | CNil: ctxt [] *)
|
||||
(* | CCons: forall {ts: list type} (t: type), *)
|
||||
(* ctxt ts -> ctxt (t::ts). *)
|
||||
|
||||
Inductive term: Type :=
|
||||
(* de-Bruijn index *)
|
||||
| Var: nat -> term
|
||||
| App: term -> term -> term
|
||||
| Abs: type -> term -> term.
|
||||
|
||||
Definition ctxt: Type := list nat.
|
||||
|
||||
Fixpoint typecheck (Γ: ctxt) (tm: term): option type :=
|
||||
match tm with
|
||||
| Var n => _
|
||||
| App tm1 tm2 => _
|
||||
| Abs v tm' => _
|
||||
end.
|
||||
|
47
coq/vec-last.v
Normal file
47
coq/vec-last.v
Normal file
@ -0,0 +1,47 @@
|
||||
Require Import Vector.
|
||||
Import VectorNotations.
|
||||
|
||||
Print last.
|
||||
Check last.
|
||||
|
||||
Fixpoint lst' {A:Type} {n:nat} (v: Vector.t A (S n)): A :=
|
||||
match v in Vector.t _ (S n) return
|
||||
match n with
|
||||
| O => A
|
||||
| S n' => A
|
||||
end
|
||||
with
|
||||
| [] => idProp
|
||||
| [x] => x
|
||||
| _::x::v' => lst' (x::v')
|
||||
end.
|
||||
|
||||
Fixpoint lst' {A:Type} {n:nat} (v: Vector.t A (S n)) {struct n}: A.
|
||||
refine (
|
||||
match v with
|
||||
| [] => idProp
|
||||
| [x] => x
|
||||
| _::x::v' => _
|
||||
end).
|
||||
exact (lst' _ _ (x::v')).
|
||||
Qed.
|
||||
|
||||
Check rectS.
|
||||
|
||||
Program Fixpoint lst {A:Type} {n:nat} (v: Vector.t A n)
|
||||
: match n with
|
||||
| O => IDProp:Type
|
||||
| S _ => A
|
||||
end :=
|
||||
match v in Vector.t _ n return
|
||||
match n with
|
||||
| O => IDProp
|
||||
| S _ => A
|
||||
end with
|
||||
| [] => idProp
|
||||
| [x] => x
|
||||
| _ :: vv =>
|
||||
lst _
|
||||
end.
|
||||
Next Obligation.
|
||||
Abort.
|
44
haskell/cats/Orders.hs
Normal file
44
haskell/cats/Orders.hs
Normal file
@ -0,0 +1,44 @@
|
||||
-- https://bartoszmilewski.com/2014/12/05/categories-great-and-small/
|
||||
|
||||
{-
|
||||
-- https://hackage.haskell.org/package/base-4.19.0.0/docs/Data-Semigroup.html
|
||||
-- https://hackage.haskell.org/package/base-4.19.1.0/docs/Data-Monoid.html
|
||||
|
||||
instance Semigroup Int where
|
||||
-- An associative function
|
||||
(<>) = (+)
|
||||
|
||||
instance Monoid Int where
|
||||
-- Neutral element. ie, identity
|
||||
mempty = 0
|
||||
-}
|
||||
|
||||
class MonoidTC a where
|
||||
idty :: a
|
||||
op :: a -> a -> a
|
||||
|
||||
instance MonoidTC Int where
|
||||
-- It's our job to ensure that these values indeed
|
||||
-- does satisfy monoid rules.
|
||||
idty = 0
|
||||
op = (+)
|
||||
|
||||
instance MonoidTC String where
|
||||
idty = ""
|
||||
op = (++)
|
||||
|
||||
|
||||
{- `Hask' category -}
|
||||
|
||||
{- A monoid is a single-object category ?? -}
|
||||
|
||||
|
||||
|
||||
-- Isomorphism between Either () a and Maybe a
|
||||
e2m :: Either () a -> Maybe a
|
||||
e2m (Left _) = Nothing
|
||||
e2m (Right a) = Just a
|
||||
|
||||
m2e :: Maybe a -> Either () a
|
||||
m2e (Just a) = Right a
|
||||
m2e Nothing = Left ()
|
16
haskell/clash/Dfa.hs
Normal file
16
haskell/clash/Dfa.hs
Normal file
@ -0,0 +1,16 @@
|
||||
import Clash.Prelude
|
||||
|
||||
data State a
|
||||
= Inter (a -> Bool)
|
||||
| Good
|
||||
|
||||
|
||||
data Nfa a = Nfa {
|
||||
states :: State a,
|
||||
tf :: [State a -> [State a]]
|
||||
}
|
||||
|
||||
-- data Nfa a = Nfa {
|
||||
-- -- states :: State a
|
||||
-- tf :: [State a -> [State a]]
|
||||
-- }
|
116
haskell/megaparsec-eg/Re2.hs
Normal file
116
haskell/megaparsec-eg/Re2.hs
Normal file
@ -0,0 +1,116 @@
|
||||
{-# LANGUAGE OverloadedStrings #-}
|
||||
|
||||
import Text.Megaparsec
|
||||
import Text.Megaparsec.Char
|
||||
import qualified Text.Megaparsec.Char.Lexer as L
|
||||
import Control.Monad.Combinators.Expr
|
||||
import Data.Char
|
||||
import Data.Void
|
||||
import Data.Text
|
||||
|
||||
type Parser = Parsec Void Text
|
||||
|
||||
data Re a
|
||||
= Atom a
|
||||
| (Re a) :- (Re a)
|
||||
| Rep (Re a) Integer (Maybe Integer)
|
||||
| Eps
|
||||
deriving Show
|
||||
|
||||
infixr 6 :-
|
||||
|
||||
uchar :: Parser Char
|
||||
uchar = satisfy isUpper
|
||||
|
||||
uchars :: Parser [Char]
|
||||
uchars = many uchar
|
||||
|
||||
atom :: Parser (Re Char)
|
||||
atom = Atom <$> uchar
|
||||
|
||||
cat :: Parser (Re Char -> Re Char -> Re Char)
|
||||
cat = do
|
||||
return $ \r1 r2 -> r1 :- r2
|
||||
|
||||
-- r{n,}
|
||||
atleast :: Parser (Re Char -> Re Char)
|
||||
atleast = do
|
||||
_ <- char '{'
|
||||
n <- L.decimal
|
||||
_ <- char ','
|
||||
_ <- char '}'
|
||||
return $ \r -> Rep r n Nothing
|
||||
|
||||
-- r{,n}
|
||||
atmost :: Parser (Re Char -> Re Char)
|
||||
atmost = do
|
||||
_ <- char '{'
|
||||
_ <- char ','
|
||||
m <- L.decimal
|
||||
_ <- char '}'
|
||||
return $ \r -> Rep r 0 (Just m)
|
||||
|
||||
-- r{n}
|
||||
exactly :: Parser (Re Char -> Re Char)
|
||||
exactly = do
|
||||
_ <- char '{'
|
||||
n <- L.decimal
|
||||
_ <- char '}'
|
||||
return $ \r -> Rep r n (Just n)
|
||||
|
||||
-- r{n,m}
|
||||
bounded :: Parser (Re Char -> Re Char)
|
||||
bounded = do
|
||||
_ <- char '{'
|
||||
n <- L.decimal
|
||||
_ <- char ','
|
||||
m <- L.decimal
|
||||
_ <- char '}'
|
||||
return $ \r -> Rep r n (Just m)
|
||||
|
||||
rep :: Parser (Re Char -> Re Char)
|
||||
rep = choice
|
||||
[ bounded
|
||||
, atleast
|
||||
, atmost
|
||||
, exactly
|
||||
]
|
||||
|
||||
|
||||
optab :: [[Operator Parser (Re Char)]]
|
||||
optab =
|
||||
[
|
||||
[
|
||||
Postfix rep
|
||||
-- Postfix rep
|
||||
-- , Postfix atleast
|
||||
-- , Postfix atmost
|
||||
-- , Postfix exactly
|
||||
]
|
||||
,
|
||||
[
|
||||
InfixR ((:-) <$ cat)
|
||||
]
|
||||
--, [
|
||||
-- Prefix (Rep <$ rep)
|
||||
-- ]
|
||||
]
|
||||
|
||||
re :: Parser (Re Char)
|
||||
re = choice
|
||||
[ atom
|
||||
]
|
||||
|
||||
reparse :: Parser (Re Char)
|
||||
reparse = makeExprParser re optab
|
||||
|
||||
a :: IO ()
|
||||
a = parseTest (reparse <* eof) "ABCD"
|
||||
-- Atom 'A' :- (Atom 'B' :- (Atom 'C' :- Atom 'D'))
|
||||
|
||||
b :: IO ()
|
||||
b = parseTest (reparse <* eof) "A{2,3}BCD"
|
||||
-- Rep (Atom 'A') 2 (Just 3) :- (Atom 'B' :- (Atom 'C' :- Atom 'D'))
|
||||
|
||||
c :: IO ()
|
||||
c = parseTest (reparse <* eof) "A{2,}BCD"
|
5
haskell/parsec-eg/CHANGELOG.md
Normal file
5
haskell/parsec-eg/CHANGELOG.md
Normal file
@ -0,0 +1,5 @@
|
||||
# Revision history for parsec-eg
|
||||
|
||||
## 0.1.0.0 -- YYYY-mm-dd
|
||||
|
||||
* First version. Released on an unsuspecting world.
|
661
haskell/parsec-eg/LICENSE
Normal file
661
haskell/parsec-eg/LICENSE
Normal file
@ -0,0 +1,661 @@
|
||||
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||
Version 3, 19 November 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU Affero General Public License is a free, copyleft license for
|
||||
software and other kinds of works, specifically designed to ensure
|
||||
cooperation with the community in the case of network server software.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
our General Public Licenses are intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
Developers that use our General Public Licenses protect your rights
|
||||
with two steps: (1) assert copyright on the software, and (2) offer
|
||||
you this License which gives you legal permission to copy, distribute
|
||||
and/or modify the software.
|
||||
|
||||
A secondary benefit of defending all users' freedom is that
|
||||
improvements made in alternate versions of the program, if they
|
||||
receive widespread use, become available for other developers to
|
||||
incorporate. Many developers of free software are heartened and
|
||||
encouraged by the resulting cooperation. However, in the case of
|
||||
software used on network servers, this result may fail to come about.
|
||||
The GNU General Public License permits making a modified version and
|
||||
letting the public access it on a server without ever releasing its
|
||||
source code to the public.
|
||||
|
||||
The GNU Affero General Public License is designed specifically to
|
||||
ensure that, in such cases, the modified source code becomes available
|
||||
to the community. It requires the operator of a network server to
|
||||
provide the source code of the modified version running there to the
|
||||
users of that server. Therefore, public use of a modified version, on
|
||||
a publicly accessible server, gives the public access to the source
|
||||
code of the modified version.
|
||||
|
||||
An older license, called the Affero General Public License and
|
||||
published by Affero, was designed to accomplish similar goals. This is
|
||||
a different license, not a version of the Affero GPL, but Affero has
|
||||
released a new version of the Affero GPL which permits relicensing under
|
||||
this license.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU Affero General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Remote Network Interaction; Use with the GNU General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, if you modify the
|
||||
Program, your modified version must prominently offer all users
|
||||
interacting with it remotely through a computer network (if your version
|
||||
supports such interaction) an opportunity to receive the Corresponding
|
||||
Source of your version by providing access to the Corresponding Source
|
||||
from a network server at no charge, through some standard or customary
|
||||
means of facilitating copying of software. This Corresponding Source
|
||||
shall include the Corresponding Source for any work covered by version 3
|
||||
of the GNU General Public License that is incorporated pursuant to the
|
||||
following paragraph.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the work with which it is combined will remain governed by version
|
||||
3 of the GNU General Public License.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU Affero General Public License from time to time. Such new versions
|
||||
will be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU Affero General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU Affero General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU Affero General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU Affero General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU Affero General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Affero General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If your software can interact with users remotely through a computer
|
||||
network, you should also make sure that it provides a way for users to
|
||||
get its source. For example, if your program is a web application, its
|
||||
interface could display a "Source" link that leads users to an archive
|
||||
of the code. There are many ways you could offer source, and different
|
||||
solutions will be better for different programs; see section 13 for the
|
||||
specific requirements.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU AGPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
28
haskell/parsec-eg/app/Main.hs
Normal file
28
haskell/parsec-eg/app/Main.hs
Normal file
@ -0,0 +1,28 @@
|
||||
-- module Main where
|
||||
|
||||
import Control.Applicative
|
||||
import Control.Monad
|
||||
import Text.ParserCombinators.Parsec
|
||||
import Text.ParserCombinators.Parsec.Expr
|
||||
|
||||
data Re a
|
||||
= Atom a
|
||||
| Cat (Re a) (Re a)
|
||||
deriving Show
|
||||
|
||||
|
||||
-- optab :: [[Operator]
|
||||
ops =
|
||||
[ [ Postfix (Repeat (0, Nothing) <$ char '*')
|
||||
, Postfix (Repeat (1, Nothing) <$ char '+')
|
||||
, Postfix (Repeat (0, Just 1) <$ char '?')
|
||||
]
|
||||
,
|
||||
[ Infix (return sequence) AssocRight
|
||||
]
|
||||
,
|
||||
[ Infix (choice <$ char '|') AssocRight
|
||||
]
|
||||
]
|
||||
-- main :: IO ()
|
||||
-- main = putStrLn "Hello, Haskell!"
|
BIN
haskell/parsec-eg/dist-newstyle/cache/compiler
vendored
Normal file
BIN
haskell/parsec-eg/dist-newstyle/cache/compiler
vendored
Normal file
Binary file not shown.
BIN
haskell/parsec-eg/dist-newstyle/cache/config
vendored
Normal file
BIN
haskell/parsec-eg/dist-newstyle/cache/config
vendored
Normal file
Binary file not shown.
BIN
haskell/parsec-eg/dist-newstyle/cache/elaborated-plan
vendored
Normal file
BIN
haskell/parsec-eg/dist-newstyle/cache/elaborated-plan
vendored
Normal file
Binary file not shown.
BIN
haskell/parsec-eg/dist-newstyle/cache/improved-plan
vendored
Normal file
BIN
haskell/parsec-eg/dist-newstyle/cache/improved-plan
vendored
Normal file
Binary file not shown.
1
haskell/parsec-eg/dist-newstyle/cache/plan.json
vendored
Normal file
1
haskell/parsec-eg/dist-newstyle/cache/plan.json
vendored
Normal file
@ -0,0 +1 @@
|
||||
{"cabal-version":"3.10.2.1","cabal-lib-version":"3.10.2.1","compiler-id":"ghc-9.4.8","os":"linux","arch":"x86_64","install-plan":[{"type":"pre-existing","id":"array-0.5.4.0","pkg-name":"array","pkg-version":"0.5.4.0","depends":["base-4.17.2.1"]},{"type":"pre-existing","id":"base-4.17.2.1","pkg-name":"base","pkg-version":"4.17.2.1","depends":["ghc-bignum-1.3","ghc-prim-0.9.1","rts"]},{"type":"pre-existing","id":"binary-0.8.9.1","pkg-name":"binary","pkg-version":"0.8.9.1","depends":["array-0.5.4.0","base-4.17.2.1","bytestring-0.11.5.3","containers-0.6.7"]},{"type":"pre-existing","id":"bytestring-0.11.5.3","pkg-name":"bytestring","pkg-version":"0.11.5.3","depends":["base-4.17.2.1","deepseq-1.4.8.0","ghc-prim-0.9.1","template-haskell-2.19.0.0"]},{"type":"pre-existing","id":"containers-0.6.7","pkg-name":"containers","pkg-version":"0.6.7","depends":["array-0.5.4.0","base-4.17.2.1","deepseq-1.4.8.0","template-haskell-2.19.0.0"]},{"type":"pre-existing","id":"deepseq-1.4.8.0","pkg-name":"deepseq","pkg-version":"1.4.8.0","depends":["array-0.5.4.0","base-4.17.2.1","ghc-prim-0.9.1"]},{"type":"pre-existing","id":"ghc-bignum-1.3","pkg-name":"ghc-bignum","pkg-version":"1.3","depends":["ghc-prim-0.9.1"]},{"type":"pre-existing","id":"ghc-boot-th-9.4.8","pkg-name":"ghc-boot-th","pkg-version":"9.4.8","depends":["base-4.17.2.1"]},{"type":"pre-existing","id":"ghc-prim-0.9.1","pkg-name":"ghc-prim","pkg-version":"0.9.1","depends":["rts"]},{"type":"pre-existing","id":"mtl-2.2.2","pkg-name":"mtl","pkg-version":"2.2.2","depends":["base-4.17.2.1","transformers-0.5.6.2"]},{"type":"pre-existing","id":"parsec-3.1.16.1","pkg-name":"parsec","pkg-version":"3.1.16.1","depends":["base-4.17.2.1","bytestring-0.11.5.3","mtl-2.2.2","text-2.0.2"]},{"type":"configured","id":"parsec-eg-0.1.0.0-inplace-parsec-eg","pkg-name":"parsec-eg","pkg-version":"0.1.0.0","flags":{},"style":"local","pkg-src":{"type":"local","path":"/home/julinusername/gits/playground/haskell/parsec-eg/."},"dist-dir":"/home/julinusername/gits/playground/haskell/parsec-eg/dist-newstyle/build/x86_64-linux/ghc-9.4.8/parsec-eg-0.1.0.0/x/parsec-eg","build-info":"/home/julinusername/gits/playground/haskell/parsec-eg/dist-newstyle/build/x86_64-linux/ghc-9.4.8/parsec-eg-0.1.0.0/x/parsec-eg/build-info.json","depends":["base-4.17.2.1","parsec-3.1.16.1","parser-combinators-1.3.0-508bbdb5795b01e808a282e96babdf7bdb9259066465b3ad3a0334047c044a24","text-2.0.2"],"exe-depends":[],"component-name":"exe:parsec-eg","bin-file":"/home/julinusername/gits/playground/haskell/parsec-eg/dist-newstyle/build/x86_64-linux/ghc-9.4.8/parsec-eg-0.1.0.0/x/parsec-eg/build/parsec-eg/parsec-eg"},{"type":"configured","id":"parser-combinators-1.3.0-508bbdb5795b01e808a282e96babdf7bdb9259066465b3ad3a0334047c044a24","pkg-name":"parser-combinators","pkg-version":"1.3.0","flags":{"dev":false},"style":"global","pkg-src":{"type":"repo-tar","repo":{"type":"secure-repo","uri":"http://hackage.haskell.org/"}},"pkg-cabal-sha256":"8659573e0d443d573f5b53f81b81dafbdc988d282b90c11e3da73562b4ea7876","pkg-src-sha256":"9310ef0d49f8a8922acda10b1cded9854cbee04dea717effc6ee5983072e4447","depends":["base-4.17.2.1"],"exe-depends":[],"component-name":"lib"},{"type":"pre-existing","id":"pretty-1.1.3.6","pkg-name":"pretty","pkg-version":"1.1.3.6","depends":["base-4.17.2.1","deepseq-1.4.8.0","ghc-prim-0.9.1"]},{"type":"pre-existing","id":"rts","pkg-name":"rts","pkg-version":"1.0.2","depends":[]},{"type":"pre-existing","id":"template-haskell-2.19.0.0","pkg-name":"template-haskell","pkg-version":"2.19.0.0","depends":["base-4.17.2.1","ghc-boot-th-9.4.8","ghc-prim-0.9.1","pretty-1.1.3.6"]},{"type":"pre-existing","id":"text-2.0.2","pkg-name":"text","pkg-version":"2.0.2","depends":["array-0.5.4.0","base-4.17.2.1","binary-0.8.9.1","bytestring-0.11.5.3","deepseq-1.4.8.0","ghc-prim-0.9.1","template-haskell-2.19.0.0"]},{"type":"pre-existing","id":"transformers-0.5.6.2","pkg-name":"transformers","pkg-version":"0.5.6.2","depends":["base-4.17.2.1"]}]}
|
BIN
haskell/parsec-eg/dist-newstyle/cache/solver-plan
vendored
Normal file
BIN
haskell/parsec-eg/dist-newstyle/cache/solver-plan
vendored
Normal file
Binary file not shown.
BIN
haskell/parsec-eg/dist-newstyle/cache/source-hashes
vendored
Normal file
BIN
haskell/parsec-eg/dist-newstyle/cache/source-hashes
vendored
Normal file
Binary file not shown.
BIN
haskell/parsec-eg/dist-newstyle/cache/up-to-date
vendored
Normal file
BIN
haskell/parsec-eg/dist-newstyle/cache/up-to-date
vendored
Normal file
Binary file not shown.
Binary file not shown.
81
haskell/parsec-eg/parsec-eg.cabal
Normal file
81
haskell/parsec-eg/parsec-eg.cabal
Normal file
@ -0,0 +1,81 @@
|
||||
cabal-version: 3.0
|
||||
-- The cabal-version field refers to the version of the .cabal specification,
|
||||
-- and can be different from the cabal-install (the tool) version and the
|
||||
-- Cabal (the library) version you are using. As such, the Cabal (the library)
|
||||
-- version used must be equal or greater than the version stated in this field.
|
||||
-- Starting from the specification version 2.2, the cabal-version field must be
|
||||
-- the first thing in the cabal file.
|
||||
|
||||
-- Initial package description 'parsec-eg' generated by
|
||||
-- 'cabal init'. For further documentation, see:
|
||||
-- http://haskell.org/cabal/users-guide/
|
||||
--
|
||||
-- The name of the package.
|
||||
name: parsec-eg
|
||||
|
||||
-- The package version.
|
||||
-- See the Haskell package versioning policy (PVP) for standards
|
||||
-- guiding when and how versions should be incremented.
|
||||
-- https://pvp.haskell.org
|
||||
-- PVP summary: +-+------- breaking API changes
|
||||
-- | | +----- non-breaking API additions
|
||||
-- | | | +--- code changes with no API change
|
||||
version: 0.1.0.0
|
||||
|
||||
-- A short (one-line) description of the package.
|
||||
-- synopsis:
|
||||
|
||||
-- A longer description of the package.
|
||||
-- description:
|
||||
|
||||
-- The license under which the package is released.
|
||||
license: AGPL-3.0-only
|
||||
|
||||
-- The file containing the license text.
|
||||
license-file: LICENSE
|
||||
|
||||
-- The package author(s).
|
||||
author: Julin Shaji
|
||||
|
||||
-- An email address to which users can send suggestions, bug reports, and patches.
|
||||
maintainer: famubu@rawtext.club
|
||||
|
||||
-- A copyright notice.
|
||||
-- copyright:
|
||||
category: Language
|
||||
build-type: Simple
|
||||
|
||||
-- Extra doc files to be distributed with the package, such as a CHANGELOG or a README.
|
||||
extra-doc-files: CHANGELOG.md
|
||||
|
||||
-- Extra source files to be distributed with the package, such as examples, or a tutorial module.
|
||||
-- extra-source-files:
|
||||
|
||||
common warnings
|
||||
ghc-options: -Wall
|
||||
|
||||
executable parsec-eg
|
||||
-- Import common warning flags.
|
||||
import: warnings
|
||||
|
||||
-- .hs or .lhs file containing the Main module.
|
||||
main-is: Main.hs
|
||||
|
||||
-- Modules included in this executable, other than Main.
|
||||
-- other-modules:
|
||||
|
||||
-- LANGUAGE extensions used by modules in this package.
|
||||
-- other-extensions:
|
||||
|
||||
-- Other library packages from which modules are imported.
|
||||
build-depends:
|
||||
base ^>=4.17.2.1,
|
||||
text,
|
||||
parser-combinators ^>=1.3.0,
|
||||
parsec
|
||||
|
||||
-- Directories containing source files.
|
||||
hs-source-dirs: app
|
||||
|
||||
-- Base language which the package is written in.
|
||||
default-language: Haskell2010
|
2
haskell/re-cps-trial.hs
Normal file
2
haskell/re-cps-trial.hs
Normal file
@ -0,0 +1,2 @@
|
||||
data Cont i a b
|
||||
= Branch i [Cont i a Bool] [Cont i a Bool]
|
66
haskell/re-trial.hs
Normal file
66
haskell/re-trial.hs
Normal file
@ -0,0 +1,66 @@
|
||||
-- Using a non-haskell style
|
||||
|
||||
data Result =
|
||||
Ok String String
|
||||
| Err
|
||||
deriving Show
|
||||
|
||||
type Parser = String -> Result
|
||||
|
||||
eof :: Parser
|
||||
eof "" = Ok "" ""
|
||||
eof _ = Err
|
||||
|
||||
once :: Char -> Parser
|
||||
once c [] = Err
|
||||
once c (x:xs) =
|
||||
if x==c then Ok [c] xs
|
||||
else Err
|
||||
|
||||
alt :: Parser -> Parser -> Parser
|
||||
alt fa fb inp =
|
||||
case (fa inp) of
|
||||
Ok a rem -> Ok a rem
|
||||
Err ->
|
||||
case (fb inp) of
|
||||
Ok b rem -> Ok b rem
|
||||
Err -> Err
|
||||
|
||||
-- Higher precedence number, higher the precedence
|
||||
infixl 1 <|>
|
||||
(<|>) = alt
|
||||
|
||||
cat :: Parser -> Parser -> Parser
|
||||
cat fa fb inp =
|
||||
case (fa inp) of
|
||||
Ok a rem -> fb rem
|
||||
Err -> Err
|
||||
|
||||
infixl 2 <.>
|
||||
(<.>) = cat
|
||||
|
||||
-- choice :: [Parser] -> Parser
|
||||
-- choice ps inp = foldl (\acc x -> alt acc x inp) ps eof
|
||||
|
||||
-- many
|
||||
star :: Parser -> Parser
|
||||
star fa inp =
|
||||
case (fa inp) of
|
||||
Ok a xs -> star fa xs
|
||||
Err -> Ok "" inp
|
||||
|
||||
-- some
|
||||
plus :: Parser -> Parser
|
||||
plus fa inp =
|
||||
case (fa inp) of
|
||||
Ok a xs -> star fa xs
|
||||
Err -> Err
|
||||
|
||||
dot :: Parser
|
||||
dot "" = Err
|
||||
dot (x:xs) = Ok [x] xs
|
||||
|
||||
|
||||
-- a | (cb)
|
||||
aO_cb = (once 'a' <|> once 'c' <.> once 'b')
|
||||
aOc_b = ((once 'a' <|> once 'c') <.> once 'b')
|
74
latex/tikz/dfa.tex
Normal file
74
latex/tikz/dfa.tex
Normal file
@ -0,0 +1,74 @@
|
||||
% https://www3.nd.edu/~dchiang/teaching/theory/2018/www/tikz_tutorial.pdf
|
||||
|
||||
\documentclass{article} % What kind of document this is
|
||||
\usepackage{tikz} % Import the tikz package
|
||||
\usetikzlibrary{automata} % Import library for drawing automata
|
||||
\usetikzlibrary{positioning} % ...positioning nodes
|
||||
\usetikzlibrary{arrows} % ...customizing arrows
|
||||
\tikzset{
|
||||
node distance=2.5cm, % Minimum distance between two nodes. Change if necessary.
|
||||
every state/.style={ % Sets the properties for each state
|
||||
semithick,
|
||||
fill=gray!10},
|
||||
initial text={}, % No label on start arrow
|
||||
double distance=2pt, % Adjust appearance of accept states
|
||||
every edge/.style={ % Sets the properties for each transition
|
||||
draw,
|
||||
->,>=stealth', % Makes edges directed with bold arrowheads
|
||||
auto,
|
||||
semithick}}
|
||||
%\let\epsilon\varepsilon
|
||||
|
||||
\begin{document}
|
||||
|
||||
% a ; b
|
||||
\begin{figure}
|
||||
\begin{tikzpicture}
|
||||
\node[state, initial] (f1) {false};
|
||||
\node[state, right of=f1] (t1) {true};
|
||||
\node[state, right of=t1] (f2) {false};
|
||||
\node[state, accepting, right of=f2] (t2) {true};
|
||||
|
||||
\draw (f1) edge node {\tt a} (t1);
|
||||
\draw (t1) edge[bend left, above] node {\tt $\varepsilon$} (f2);
|
||||
%\draw (t1.east) edge[bend left] node {\tt $\varepsilon$} (f2.west);
|
||||
\draw (f2) edge node {\tt b} (t2);
|
||||
\end{tikzpicture}
|
||||
\caption{$a;b$}
|
||||
\end{figure}
|
||||
|
||||
% % a | b
|
||||
% \begin{figure}
|
||||
% \begin{tikzpicture}
|
||||
% \node[state, initial] (f1) {false};
|
||||
% \node[state, accepting, right of=f1] (t1) {true};
|
||||
% \draw (f1) edge node {\tt a} (t1);
|
||||
%
|
||||
% \node[state, initial, below of=f1] (f2) {false};
|
||||
% \node[state, accepting, right of=f2] (t2) {true};
|
||||
% \draw (f2) edge node {\tt b} (t2);
|
||||
% \end{tikzpicture}
|
||||
% \caption{$a|b$}
|
||||
% \end{figure}
|
||||
%
|
||||
% \vspace{3cm}
|
||||
%
|
||||
% % a*
|
||||
% \begin{figure}
|
||||
% \begin{tikzpicture}
|
||||
% \node[state, accepting, initial] (None) {None};
|
||||
% \node[state, right of=None] (false) {false};
|
||||
% \node[state, right of=false] (true) {true};
|
||||
% % \draw (None) edge[loop above] node {\tt 0} (None);
|
||||
% \draw (None) edge node {\tt $\varepsilon$} (false);
|
||||
%
|
||||
% % \draw (false) edge[loop above] node {\tt 1} (false);
|
||||
% % \draw (false) edge[bend left] node {\tt 0} (true);
|
||||
% % \draw (true) edge[bend left] node {{\tt 0}, {\tt 1}} (false);
|
||||
% \draw (false) edge node {\tt a} (true);
|
||||
% \draw (true) edge[bend left] node {$\varepsilon$} (None);
|
||||
% \end{tikzpicture}
|
||||
% \caption{$a*$}
|
||||
% \end{figure}
|
||||
|
||||
\end{document}
|
Loading…
Reference in New Issue
Block a user