https://gitlab.com/nomadic-labs/mi-cho-coq
Revision d116674d67eca4b4b15d7c08efd878a8c8aa864b authored by kristinas on 11 May 2021, 09:41:59 UTC, committed by kristinas on 11 May 2021, 09:41:59 UTC
1 parent f70493e
Tip revision: d116674d67eca4b4b15d7c08efd878a8c8aa864b authored by kristinas on 11 May 2021, 09:41:59 UTC
Added README
Added README
Tip revision: d116674
syntax_type.v
Require String.
Definition annotation := String.string.
Definition annot_o := Datatypes.option annotation.
Module default_entrypoint.
Import String.
Definition default : annotation := "%default"%string.
End default_entrypoint.
Inductive simple_comparable_type : Set :=
| string
| nat
| int
| bytes
| bool
| mutez
| address
| key_hash
| timestamp.
Inductive comparable_type : Set :=
| Comparable_type_simple : simple_comparable_type -> comparable_type
| Cpair : simple_comparable_type -> comparable_type -> comparable_type.
Lemma comparable_type_dec (a b : comparable_type) : {a = b} + {a <> b}.
Proof.
repeat decide equality.
Defined.
Inductive type : Set :=
| Comparable_type (_ : simple_comparable_type)
| key
| unit
| signature
| option (a : type)
| list (a : type)
| set (a : comparable_type)
| contract (a : type)
| operation
| pair (a : type) (b : type)
| or (a : type) (_ : annot_o) (b : type) (_ : annot_o)
| lambda (a b : type)
| map (k : comparable_type) (v : type)
| big_map (k : comparable_type) (v : type)
| chain_id.
Fixpoint comparable_type_to_type (c : comparable_type) : type :=
match c with
| Comparable_type_simple a => Comparable_type a
| Cpair a b => pair (Comparable_type a) (comparable_type_to_type b)
end.
Coercion comparable_type_to_type : comparable_type >-> type.
Coercion Comparable_type_simple : simple_comparable_type >-> comparable_type.
(* Coercion Comparable_type : simple_comparable_type >-> type. *)
Fixpoint is_packable (a : type) : Datatypes.bool :=
match a with
| operation | big_map _ _ | contract _ => false
| Comparable_type _ | unit | signature | key | lambda _ _ | set _ | chain_id => true
| option ty
| list ty
| map _ ty => is_packable ty
| pair a b | or a _ b _ => is_packable a && is_packable b
end.
Lemma type_dec (a b : type) : {a = b} + {a <> b}.
Proof.
repeat decide equality.
Defined.
Lemma stype_dec (A B : Datatypes.list type) : {A = B} + {A <> B}.
Proof.
decide equality; apply type_dec.
Defined.
Infix ":::" := (@cons type) (at level 60, right associativity).
Infix "+++" := (@app type) (at level 60, right associativity).
Computing file changes ...