https://gitlab.com/nomadic-labs/mi-cho-coq
Tip revision: db3fcd7d2e3b13c3ac93821ab76b41c9c34ae7de authored by Yann Regis-Gianas on 03 March 2021, 13:29:53 UTC
Merge branch 'yrg@make-mutez-more-readable' into 'dev'
Merge branch 'yrg@make-mutez-more-readable' into 'dev'
Tip revision: db3fcd7
syntax.v
(* Open Source License *)
(* Copyright (c) 2019 Nomadic Labs. <contact@nomadic-labs.com> *)
(* Permission is hereby granted, free of charge, to any person obtaining a *)
(* copy of this software and associated documentation files (the "Software"), *)
(* to deal in the Software without restriction, including without limitation *)
(* the rights to use, copy, modify, merge, publish, distribute, sublicense, *)
(* and/or sell copies of the Software, and to permit persons to whom the *)
(* Software is furnished to do so, subject to the following conditions: *)
(* The above copyright notice and this permission notice shall be included *)
(* in all copies or substantial portions of the Software. *)
(* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR *)
(* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, *)
(* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL *)
(* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *)
(* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *)
(* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER *)
(* DEALINGS IN THE SOFTWARE. *)
(* Syntax and typing of the Michelson language *)
Require Import ZArith.
Require String.
Require Import ListSet.
Require set map.
Require Import comparable.
Require tez.
Require Export syntax_type.
(* source: http://doc.tzalpha.net/whitedoc/michelson.html#xii-full-grammar *)
Section Overloading.
(* Boolean binary opertations (OR and XOR) are overloaded as bitwise
operations for nat. AND also has a case for int and nat. *)
Inductive bitwise_variant : type -> Set :=
| Bitwise_variant_bool : bitwise_variant bool
| Bitwise_variant_nat : bitwise_variant nat.
Structure bitwise_struct (a : type) :=
Mk_bitwise { bitwise_variant_field : bitwise_variant a }.
Canonical Structure bitwise_bool : bitwise_struct bool := {| bitwise_variant_field := Bitwise_variant_bool |}.
Canonical Structure bitwise_nat : bitwise_struct nat := {| bitwise_variant_field := Bitwise_variant_nat |}.
Inductive and_variant : type -> type -> type -> Set :=
| And_variant_bool : and_variant bool bool bool
| And_variant_nat : and_variant nat nat nat
| And_variant_int : and_variant int nat nat.
Structure and_struct (a b : type) :=
Mk_and { and_ret_type : type; and_variant_field : and_variant a b and_ret_type }.
Canonical Structure and_bool : and_struct bool bool := {| and_variant_field := And_variant_bool |}.
Canonical Structure and_nat : and_struct nat nat := {| and_variant_field := And_variant_nat |}.
Canonical Structure and_int : and_struct int nat := {| and_variant_field := And_variant_int |}.
Set Warnings "-redundant-canonical-projection".
(* Logical negation is also overloaded for int *)
Inductive not_variant : type -> type -> Set :=
| Not_variant_bool : not_variant bool bool
| Not_variant_nat : not_variant nat int
| Not_variant_int : not_variant int int.
Structure not_struct (a : type) :=
Mk_not { not_ret_type : type; not_variant_field : not_variant a not_ret_type }.
Canonical Structure not_bool : not_struct bool :=
{| not_variant_field := Not_variant_bool |}.
Canonical Structure not_nat : not_struct nat :=
{| not_variant_field := Not_variant_nat |}.
Canonical Structure not_int : not_struct int :=
{| not_variant_field := Not_variant_int |}.
(* NEG takes either a nat or an int as argument *)
Inductive neg_variant : type -> Set :=
| Neg_variant_nat : neg_variant nat
| Neg_variant_int : neg_variant int.
Structure neg_struct (a : type) := Mk_neg { neg_variant_field : neg_variant a }.
Canonical Structure neg_nat : neg_struct nat :=
{| neg_variant_field := Neg_variant_nat |}.
Canonical Structure neg_int : neg_struct int :=
{| neg_variant_field := Neg_variant_int |}.
(* ADD *)
Inductive add_variant : type -> type -> type -> Set :=
| Add_variant_nat_nat : add_variant nat nat nat
| Add_variant_nat_int : add_variant nat int int
| Add_variant_int_nat : add_variant int nat int
| Add_variant_int_int : add_variant int int int
| Add_variant_timestamp_int : add_variant timestamp int timestamp
| Add_variant_int_timestamp : add_variant int timestamp timestamp
| Add_variant_tez_tez : add_variant mutez mutez mutez.
Structure add_struct (a b : type) :=
Mk_add { add_ret_type : type; add_variant_field : add_variant a b add_ret_type }.
Canonical Structure add_nat_nat : add_struct nat nat :=
{| add_variant_field := Add_variant_nat_nat |}.
Canonical Structure add_nat_int : add_struct nat int :=
{| add_variant_field := Add_variant_nat_int |}.
Canonical Structure add_int_nat : add_struct int nat :=
{| add_variant_field := Add_variant_int_nat |}.
Canonical Structure add_int_int : add_struct int int :=
{| add_variant_field := Add_variant_int_int |}.
Canonical Structure add_timestamp_int : add_struct timestamp int :=
{| add_variant_field := Add_variant_timestamp_int |}.
Canonical Structure add_int_timestamp : add_struct int timestamp :=
{| add_variant_field := Add_variant_int_timestamp |}.
Canonical Structure add_tez_tez : add_struct mutez mutez :=
{| add_variant_field := Add_variant_tez_tez |}.
(* SUB *)
Inductive sub_variant : type -> type -> type -> Set :=
| Sub_variant_nat_nat : sub_variant nat nat int
| Sub_variant_nat_int : sub_variant nat int int
| Sub_variant_int_nat : sub_variant int nat int
| Sub_variant_int_int : sub_variant int int int
| Sub_variant_timestamp_int : sub_variant timestamp int timestamp
| Sub_variant_timestamp_timestamp : sub_variant timestamp timestamp int
| Sub_variant_tez_tez : sub_variant mutez mutez mutez.
Structure sub_struct (a b : type) :=
Mk_sub { sub_ret_type : type; sub_variant_field : sub_variant a b sub_ret_type }.
Canonical Structure sub_nat_nat : sub_struct nat nat :=
{| sub_variant_field := Sub_variant_nat_nat |}.
Canonical Structure sub_nat_int : sub_struct nat int :=
{| sub_variant_field := Sub_variant_nat_int |}.
Canonical Structure sub_int_nat : sub_struct int nat :=
{| sub_variant_field := Sub_variant_int_nat |}.
Canonical Structure sub_int_int : sub_struct int int :=
{| sub_variant_field := Sub_variant_int_int |}.
Canonical Structure sub_timestamp_int : sub_struct timestamp int :=
{| sub_variant_field := Sub_variant_timestamp_int |}.
Canonical Structure sub_timestamp_timestamp : sub_struct timestamp timestamp :=
{| sub_variant_field := Sub_variant_timestamp_timestamp |}.
Canonical Structure sub_tez_tez : sub_struct mutez mutez :=
{| sub_variant_field := Sub_variant_tez_tez |}.
(* MUL *)
Inductive mul_variant : type -> type -> type -> Set :=
| Mul_variant_nat_nat : mul_variant nat nat nat
| Mul_variant_nat_int : mul_variant nat int int
| Mul_variant_int_nat : mul_variant int nat int
| Mul_variant_int_int : mul_variant int int int
| Mul_variant_tez_nat : mul_variant mutez nat mutez
| Mul_variant_nat_tez : mul_variant nat mutez mutez.
Structure mul_struct (a b : type) :=
Mk_mul { mul_ret_type : type; mul_variant_field : mul_variant a b mul_ret_type }.
Canonical Structure mul_nat_nat : mul_struct nat nat :=
{| mul_variant_field := Mul_variant_nat_nat |}.
Canonical Structure mul_nat_int : mul_struct nat int :=
{| mul_variant_field := Mul_variant_nat_int |}.
Canonical Structure mul_int_nat : mul_struct int nat :=
{| mul_variant_field := Mul_variant_int_nat |}.
Canonical Structure mul_int_int : mul_struct int int :=
{| mul_variant_field := Mul_variant_int_int |}.
Canonical Structure mul_tez_nat : mul_struct mutez nat :=
{| mul_variant_field := Mul_variant_tez_nat |}.
Canonical Structure mul_nat_tez : mul_struct nat mutez :=
{| mul_variant_field := Mul_variant_nat_tez |}.
(* EDIV *)
Inductive ediv_variant : type -> type -> type -> type -> Set :=
| Ediv_variant_nat_nat : ediv_variant nat nat nat nat
| Ediv_variant_nat_int : ediv_variant nat int int nat
| Ediv_variant_int_nat : ediv_variant int nat int nat
| Ediv_variant_int_int : ediv_variant int int int nat
| Ediv_variant_tez_nat : ediv_variant mutez nat mutez mutez
| Ediv_variant_tez_tez : ediv_variant mutez mutez nat mutez.
Structure ediv_struct (a b : type) :=
Mk_ediv { ediv_quo_type : type; ediv_rem_type : type;
ediv_variant_field : ediv_variant a b ediv_quo_type ediv_rem_type }.
Canonical Structure ediv_nat_nat : ediv_struct nat nat :=
{| ediv_variant_field := Ediv_variant_nat_nat |}.
Canonical Structure ediv_nat_int : ediv_struct nat int :=
{| ediv_variant_field := Ediv_variant_nat_int |}.
Canonical Structure ediv_int_nat : ediv_struct int nat :=
{| ediv_variant_field := Ediv_variant_int_nat |}.
Canonical Structure ediv_int_int : ediv_struct int int :=
{| ediv_variant_field := Ediv_variant_int_int |}.
Canonical Structure ediv_tez_nat : ediv_struct mutez nat :=
{| ediv_variant_field := Ediv_variant_tez_nat |}.
Canonical Structure ediv_tez_tez : ediv_struct mutez mutez :=
{| ediv_variant_field := Ediv_variant_tez_tez |}.
(* SLICE and CONCAT *)
Inductive stringlike_variant : type -> Set :=
| Stringlike_variant_string : stringlike_variant string
| Stringlike_variant_bytes : stringlike_variant bytes.
Structure stringlike_struct (a : type) :=
Mk_stringlike { stringlike_variant_field : stringlike_variant a }.
Canonical Structure stringlike_string : stringlike_struct string :=
{| stringlike_variant_field := Stringlike_variant_string |}.
Canonical Structure stringlike_bytes : stringlike_struct bytes :=
{| stringlike_variant_field := Stringlike_variant_bytes |}.
(* SIZE *)
Inductive size_variant : type -> Set :=
| Size_variant_set a : size_variant (set a)
| Size_variant_map key val : size_variant (map key val)
| Size_variant_list a : size_variant (list a)
| Size_variant_string : size_variant string
| Size_variant_bytes : size_variant bytes.
Structure size_struct (a : type) :=
Mk_size { size_variant_field : size_variant a }.
Canonical Structure size_set a : size_struct (set a) :=
{| size_variant_field := Size_variant_set a |}.
Canonical Structure size_map key val : size_struct (map key val) :=
{| size_variant_field := Size_variant_map key val |}.
Canonical Structure size_list a : size_struct (list a) :=
{| size_variant_field := Size_variant_list a |}.
Canonical Structure size_string : size_struct string :=
{| size_variant_field := Size_variant_string |}.
Canonical Structure size_bytes : size_struct bytes :=
{| size_variant_field := Size_variant_bytes |}.
(* MEM *)
Inductive mem_variant : comparable_type -> type -> Set :=
| Mem_variant_set a : mem_variant a (set a)
| Mem_variant_map key val : mem_variant key (map key val)
| Mem_variant_bigmap key val : mem_variant key (big_map key val).
Structure mem_struct (key : comparable_type) (a : type) :=
Mk_mem { mem_variant_field : mem_variant key a }.
Canonical Structure mem_set a : mem_struct a (set a) :=
{| mem_variant_field := Mem_variant_set a |}.
Canonical Structure mem_map key val : mem_struct key (map key val) :=
{| mem_variant_field := Mem_variant_map key val |}.
Canonical Structure mem_bigmap key val : mem_struct key (big_map key val) :=
{| mem_variant_field := Mem_variant_bigmap key val |}.
(* UPDATE *)
Inductive update_variant : comparable_type -> type -> type -> Set :=
| Update_variant_set a : update_variant a bool (set a)
| Update_variant_map key val :
update_variant key (option val) (map key val)
| Update_variant_bigmap key val :
update_variant key (option val) (big_map key val).
Structure update_struct key val collection :=
Mk_update { update_variant_field : update_variant key val collection }.
Canonical Structure update_set a : update_struct a bool (set a) :=
{| update_variant_field := Update_variant_set a |}.
Canonical Structure update_map key val :=
{| update_variant_field := Update_variant_map key val |}.
Canonical Structure update_bigmap key val :=
{| update_variant_field := Update_variant_bigmap key val |}.
(* ITER *)
Inductive iter_variant : type -> type -> Set :=
| Iter_variant_set (a : comparable_type) : iter_variant a (set a)
| Iter_variant_map (key : comparable_type) val :
iter_variant (pair key val) (map key val)
| Iter_variant_list a : iter_variant a (list a).
Structure iter_struct collection :=
Mk_iter { iter_elt_type : type;
iter_variant_field : iter_variant iter_elt_type collection }.
Canonical Structure iter_set (a : comparable_type) : iter_struct (set a) :=
{| iter_variant_field := Iter_variant_set a |}.
Canonical Structure iter_map (key : comparable_type) val :
iter_struct (map key val) :=
{| iter_variant_field := Iter_variant_map key val |}.
Canonical Structure iter_list (a : type) : iter_struct (list a) :=
{| iter_variant_field := Iter_variant_list a |}.
(* GET *)
Inductive get_variant : comparable_type -> type -> type -> Set :=
| Get_variant_map key val : get_variant key val (map key val)
| Get_variant_bigmap key val : get_variant key val (big_map key val).
Structure get_struct key collection :=
Mk_get { get_val_type : type;
get_variant_field : get_variant key get_val_type collection }.
Canonical Structure get_map key (val : type) : get_struct key (map key val) :=
{| get_variant_field := Get_variant_map key val |}.
Canonical Structure get_bigmap key (val : type) : get_struct key (big_map key val) :=
{| get_variant_field := Get_variant_bigmap key val |}.
(* MAP *)
Inductive map_variant : type -> type -> type -> type -> Set :=
| Map_variant_map (key : comparable_type) val b :
map_variant (pair key val) b (map key val) (map key b)
| Map_variant_list a b :
map_variant a b (list a) (list b).
Structure map_struct collection b :=
Mk_map { map_in_type : type; map_out_collection_type : type;
map_variant_field :
map_variant map_in_type b collection map_out_collection_type }.
Canonical Structure map_map (key : comparable_type) val b :
map_struct (map key val) b :=
{| map_variant_field := Map_variant_map key val b |}.
Canonical Structure map_list (a : type) b : map_struct (list a) b :=
{| map_variant_field := Map_variant_list a b |}.
End Overloading.
Inductive elt_pair (a b : Set) : Set :=
| Elt : a -> b -> elt_pair a b.
Definition stack_type := Datatypes.list type.
Definition opt_bind {A B : Set} (m : Datatypes.option A) (f : A -> Datatypes.option B) : Datatypes.option B :=
match m with
| Some a => f a
| None => None
end.
Definition opt_merge {A : Set} (m1 m2 : Datatypes.option A) : Datatypes.option A :=
match m1 with
| Some a1 => Some a1
| None => m2
end.
(* Returns [Some a] if the root annotation [an] is exactly [Some e];
returns [None] otherwise *)
Definition get_entrypoint_root (e : annotation) (a : type) (an : annot_o) :
Datatypes.option type :=
opt_bind an (fun e' => if String.string_dec e e' then Some a else None).
(* Returns the first entrypoint to match e in the annotated type (a, an).
The traversal is depth-first *)
Fixpoint get_entrypoint (e : annotation) (a : type) (an : annot_o) : Datatypes.option type :=
opt_merge (get_entrypoint_root e a an)
(match a with
| or a annot_a b annot_b =>
opt_merge (get_entrypoint e a annot_a) (get_entrypoint e b annot_b)
| _ => None
end).
(* Returns the type of the default entrypoint *)
Definition get_default_entrypoint (a : type) (an : annot_o) : Datatypes.option type :=
opt_merge (get_entrypoint default_entrypoint.default a an)
(Some a).
Definition get_entrypoint_opt (e : annot_o) (a : type) (an : annot_o) : Datatypes.option type :=
match e with
| None => get_default_entrypoint a an
| Some e =>
if String.string_dec e default_entrypoint.default
then get_default_entrypoint a an
else get_entrypoint e a an
end.
Definition isSome {A : Set} (m : Datatypes.option A) : Prop :=
match m with
| None => False
| Some _ => True
end.
Definition isSome_maybe {A : Set} error (o : Datatypes.option A) : error.M (isSome o) :=
match o return error.M (isSome o) with
| Some _ => error.Return I
| None => error.Failed _ error
end.
Definition get_opt {A : Set} (m : Datatypes.option A) (H : isSome m) : A :=
match m, H with
| Some a, I => a
| None, H => match H with end
end.
Definition self_info := Datatypes.option (type * annot_o)%type.
(* The self_type parameter is only here to ensure the so-called
uniform inheritance condition allowing to use Instruction_opcode as
an implicit coearcion *)
Inductive opcode {self_type : self_info} : forall (A B : Datatypes.list type), Set :=
| APPLY {a b c D} {_ : Bool.Is_true (is_packable a)} :
opcode (a ::: lambda (pair a b) c ::: D) (lambda b c ::: D)
| DUP {a A} : opcode (a ::: A) (a ::: a ::: A)
| SWAP {a b A} : opcode (a ::: b ::: A) (b ::: a ::: A)
| UNIT {A} : opcode A (unit :: A)
| EQ {S} : opcode (int ::: S) (bool ::: S)
| NEQ {S} : opcode (int ::: S) (bool ::: S)
| LT {S} : opcode (int ::: S) (bool ::: S)
| GT {S} : opcode (int ::: S) (bool ::: S)
| LE {S} : opcode (int ::: S) (bool ::: S)
| GE {S} : opcode (int ::: S) (bool ::: S)
| OR {b} {s : bitwise_struct b} {S} : opcode (b ::: b ::: S) (b ::: S)
| AND {a b} {s : and_struct a b} {S} : opcode (a ::: b ::: S) (and_ret_type _ _ s ::: S)
| XOR {b} {s : bitwise_struct b} {S} : opcode (b ::: b ::: S) (b ::: S)
| NOT {b} {s : not_struct b} {S} : opcode (b ::: S) (not_ret_type _ s ::: S)
| NEG {n} {s : neg_struct n} {S} : opcode (n ::: S) (int ::: S)
| ABS {S} : opcode (int ::: S) (nat ::: S)
| ISNAT {S} : opcode (int ::: S) (option nat ::: S)
| INT {S} : opcode (nat ::: S) (int ::: S)
| ADD {a b} {s : add_struct a b} {S} :
opcode (a ::: b ::: S) (add_ret_type _ _ s ::: S)
| SUB {a b} {s : sub_struct a b} {S} :
opcode (a ::: b ::: S) (sub_ret_type _ _ s ::: S)
| MUL {a b} {s : mul_struct a b} {S} :
opcode (a ::: b ::: S) (mul_ret_type _ _ s ::: S)
| EDIV {a b} {s : ediv_struct a b} {S} : opcode (a ::: b ::: S) (option (pair (ediv_quo_type _ _ s) (ediv_rem_type _ _ s)) :: S)
| LSL {S} : opcode (nat ::: nat ::: S) (nat ::: S)
| LSR {S} : opcode (nat ::: nat ::: S) (nat ::: S)
| COMPARE {a : comparable_type} {S} : opcode (a ::: a ::: S) (int ::: S)
| CONCAT {a} {i : stringlike_struct a} {S} : opcode (a ::: a ::: S) (a ::: S)
| CONCAT_list {a} {i : stringlike_struct a} {S} : opcode (list a ::: S) (a ::: S)
| SIZE {a} {i : size_struct a} {S} :
opcode (a ::: S) (nat ::: S)
| SLICE {a} {i : stringlike_struct a} {S} :
opcode (nat ::: nat ::: a ::: S) (option a ::: S)
| PAIR {a b S} : opcode (a ::: b ::: S) (pair a b :: S)
| CAR {a b S} : opcode (pair a b :: S) (a :: S)
| CDR {a b S} : opcode (pair a b :: S) (b :: S)
| EMPTY_SET elt {S} : opcode S (set elt ::: S)
| MEM {elt a} {i : mem_struct elt a} {S} :
opcode (elt ::: a ::: S) (bool ::: S)
| UPDATE {elt val collection} {i : update_struct elt val collection} {S} :
opcode (elt ::: val ::: collection ::: S) (collection ::: S)
| EMPTY_MAP (key : comparable_type) (val : type) {S} :
opcode S (map key val :: S)
| EMPTY_BIG_MAP (key : comparable_type) (val : type) {S} :
opcode S (big_map key val :: S)
| GET {key collection} {i : get_struct key collection} {S} :
opcode (key ::: collection ::: S) (option (get_val_type _ _ i) :: S)
| SOME {a S} : opcode (a :: S) (option a :: S)
| NONE (a : type) {S} : opcode S (option a :: S)
| LEFT {a} (b : type) {S} : opcode (a :: S) (or a None b None :: S)
| RIGHT (a : type) {b S} : opcode (b :: S) (or a None b None :: S)
| CONS {a S} : opcode (a ::: list a ::: S) (list a :: S)
| NIL (a : type) {S} : opcode S (list a :: S)
| TRANSFER_TOKENS {p S} :
opcode (p ::: mutez ::: contract p ::: S) (operation ::: S)
| SET_DELEGATE {S} :
opcode (option key_hash ::: S) (operation ::: S)
| BALANCE {S} : opcode S (mutez ::: S)
| ADDRESS {p S} : opcode (contract p ::: S) (address ::: S)
| CONTRACT {S} (annot_opt : Datatypes.option annotation) p :
opcode (address ::: S) (option (contract p) ::: S)
| SOURCE {S} : opcode S (address ::: S)
| SENDER {S} : opcode S (address ::: S)
| AMOUNT {S} : opcode S (mutez ::: S)
| IMPLICIT_ACCOUNT {S} : opcode (key_hash ::: S) (contract unit :: S)
| NOW {S} : opcode S (timestamp ::: S)
| PACK {a S} : opcode (a ::: S) (bytes ::: S)
| UNPACK a {S} : opcode (bytes ::: S) (option a ::: S)
| HASH_KEY {S} : opcode (key ::: S) (key_hash ::: S)
| BLAKE2B {S} : opcode (bytes ::: S) (bytes ::: S)
| SHA256 {S} : opcode (bytes ::: S) (bytes ::: S)
| SHA512 {S} : opcode (bytes ::: S) (bytes ::: S)
| CHECK_SIGNATURE {S} : opcode (key ::: signature ::: bytes ::: S) (bool ::: S)
| DIG (n : Datatypes.nat) {S1 S2 t} :
length S1 = n ->
opcode (S1 +++ (t ::: S2)) (t ::: S1 +++ S2)
| DUG (n : Datatypes.nat) {S1 S2 t} :
length S1 = n ->
opcode (t ::: S1 +++ S2) (S1 +++ (t ::: S2))
| DROP (n : Datatypes.nat) {A B} :
length A = n ->
opcode (A +++ B) B
| CHAIN_ID {S} : opcode S (chain_id ::: S).
Inductive if_family : forall (A B : Datatypes.list type) (a : type), Set :=
| IF_bool : if_family nil nil bool
| IF_or a an b bn : if_family (a :: nil) (b :: nil) (or a an b bn)
| IF_option a : if_family nil (a :: nil) (option a)
| IF_list a : if_family (a ::: list a ::: nil) nil (list a).
Inductive loop_family : forall (A B : Datatypes.list type) (a : type), Set :=
| LOOP_bool : loop_family nil nil bool
| LOOP_or a an b bn : loop_family (a :: nil) (b :: nil) (or a an b bn).
Inductive instruction :
forall (self_type : self_info) (tail_fail_flag : Datatypes.bool) (A B : Datatypes.list type), Set :=
| Instruction_seq {self_type tff A B} :
instruction_seq self_type tff A B ->
instruction self_type tff A B
| FAILWITH {self_type A B a} : instruction self_type Datatypes.true (a ::: A) B
| IF_ {self_type A B tffa tffb C1 C2 t} (i : if_family C1 C2 t) :
instruction_seq self_type tffa (C1 ++ A) B -> instruction_seq self_type tffb (C2 ++ A) B ->
instruction self_type (tffa && tffb) (t ::: A) B
| LOOP_ {self_type tff C1 C2 t A} (i : loop_family C1 C2 t) :
instruction_seq self_type tff (C1 ++ A) (t :: A) ->
instruction self_type Datatypes.false (t :: A) (C2 ++ A)
| PUSH (a : type) (x : concrete_data a) {self_type A} : instruction self_type Datatypes.false A (a :: A)
| LAMBDA (a b : type) {self_type A tff} :
instruction_seq None tff (a :: nil) (b :: nil) ->
instruction self_type Datatypes.false A (lambda a b :: A)
| ITER {self_type tff collection} {i : iter_struct collection} {A} :
instruction_seq self_type tff (iter_elt_type _ i ::: A) A ->
instruction self_type Datatypes.false (collection :: A) A
| MAP {self_type collection b} {i : map_struct collection b} {A} :
instruction_seq self_type Datatypes.false (map_in_type _ _ i :: A) (b :: A) ->
instruction self_type Datatypes.false (collection :: A) (map_out_collection_type _ _ i :: A)
| CREATE_CONTRACT {self_type S tff} (g p : type) (an : annot_o) :
instruction_seq (Some (p, an)) tff (pair p g :: nil) (pair (list operation) g :: nil) ->
instruction self_type Datatypes.false
(option key_hash ::: mutez ::: g ::: S)
(operation ::: address ::: S)
| SELF {self_type self_annot S} (annot_opt : annot_o) (H : isSome (get_entrypoint_opt annot_opt self_type self_annot)) :
instruction (Some (self_type, self_annot)) Datatypes.false S (contract (get_opt _ H) :: S)
| EXEC {self_type a b C} : instruction self_type Datatypes.false
(a ::: lambda a b ::: C) (b :: C)
| DIP (n : Datatypes.nat) {self_type A B C} :
length A = n ->
instruction_seq self_type Datatypes.false B C ->
instruction self_type Datatypes.false (A +++ B) (A +++ C)
| Instruction_opcode {self_type A B} : opcode (self_type := self_type) A B -> instruction self_type Datatypes.false A B
with instruction_seq :
forall (self_type : self_info) (tail_fail_flag : Datatypes.bool) (A B : Datatypes.list type), Set :=
| NOOP {self_type A} : instruction_seq self_type Datatypes.false A A
| Tail_fail {self_type A B} : instruction self_type Datatypes.true A B -> instruction_seq self_type Datatypes.true A B
(* The instruction self_type SEQ I C is written "{ I ; C }" in Michelson *)
| SEQ {self_type A B C tff} : instruction self_type Datatypes.false A B -> instruction_seq self_type tff B C -> instruction_seq self_type tff A C
with concrete_data : type -> Set :=
| Comparable_constant a : simple_comparable_data a -> concrete_data a
| Signature_constant : String.string -> concrete_data signature
| Key_constant : String.string -> concrete_data key
| Unit : concrete_data unit
| Pair {a b : type} : concrete_data a -> concrete_data b -> concrete_data (pair a b)
| Left {a b : type} (x : concrete_data a) an bn : concrete_data (or a an b bn)
| Right {a b : type} (x : concrete_data b) an bn : concrete_data (or a an b bn)
| Some_ {a : type} : concrete_data a -> concrete_data (option a)
| None_ {a : type} : concrete_data (option a)
| Concrete_list {a} : Datatypes.list (concrete_data a) -> concrete_data (list a)
| Concrete_set {a : comparable_type} :
set.set (comparable_data a) (compare a) ->
concrete_data (set a)
| Concrete_map {a : comparable_type} {b} :
map.map (comparable_data a) (concrete_data b) (compare a) -> concrete_data (map a b)
| Concrete_big_map {a : comparable_type} {b} :
map.map (comparable_data a) (concrete_data b) (compare a) -> concrete_data (big_map a b)
| Instruction {a b} tff : instruction_seq None tff (a ::: nil) (b ::: nil) ->
concrete_data (lambda a b)
| Chain_id_constant : chain_id_constant -> concrete_data chain_id.
Coercion Instruction_opcode : opcode >-> instruction.
Fixpoint tail_fail_induction self_type A B
(i : instruction self_type true A B)
(P : forall self_type A B, instruction self_type true A B -> Type)
(Q : forall self_type A B, instruction_seq self_type true A B -> Type)
(HFAILWITH : forall st a A B, P st (a ::: A) B FAILWITH)
(HIF : forall st A B C1 C2 t (f : if_family C1 C2 t) i1 i2,
Q st (C1 ++ A)%list B i1 ->
Q st (C2 ++ A)%list B i2 ->
P st (t ::: A) B (IF_ f i1 i2))
(HSEQ : forall st A B C i1 i2,
Q st B C i2 -> Q st A C (SEQ i1 i2))
(HTF : forall st A B i, P st A B i -> Q st A B (Tail_fail i))
(HIS : forall st A B i, Q st A B i -> P st A B (Instruction_seq i))
: P self_type A B i :=
let P' st b A B : instruction st b A B -> Type :=
if b return instruction st b A B -> Type
then P st A B
else fun i => True
in
match i as i0 in instruction st b A B return P' st b A B i0
with
| FAILWITH => HFAILWITH _ _ _ _
| @IF_ _ A B tffa tffb _ _ _ f i1 i2 =>
(if tffa as tffa return
forall i1, P' _ (tffa && tffb)%bool _ _ (IF_ f i1 i2)
then
fun i1 =>
(if tffb return
forall i2,
P' _ tffb _ _ (IF_ f i1 i2)
then
fun i2 =>
HIF _ _ _ _ _ _ f i1 i2
(tail_fail_induction_seq _ _ _ i1 P Q HFAILWITH HIF HSEQ HTF HIS)
(tail_fail_induction_seq _ _ _ i2 P Q HFAILWITH HIF HSEQ HTF HIS)
else
fun _ => I) i2
else
fun _ => I) i1
| @Instruction_seq _ true _ _ i =>
HIS _ _ _ _ (tail_fail_induction_seq _ _ _ i P Q HFAILWITH HIF HSEQ HTF HIS)
| _ => I
end
with tail_fail_induction_seq self_type A B
(i : instruction_seq self_type true A B)
(P : forall self_type A B, instruction self_type true A B -> Type)
(Q : forall self_type A B, instruction_seq self_type true A B -> Type)
(HFAILWITH : forall st a A B, P st (a ::: A) B FAILWITH)
(HIF : forall st A B C1 C2 t (f : if_family C1 C2 t) i1 i2,
Q st (C1 ++ A)%list B i1 ->
Q st (C2 ++ A)%list B i2 ->
P st (t ::: A) B (IF_ f i1 i2))
(HSEQ : forall st A B C i1 i2,
Q st B C i2 -> Q st A C (SEQ i1 i2))
(HTF : forall st A B i, P st A B i -> Q st A B (Tail_fail i))
(HIS : forall st A B i, Q st A B i -> P st A B (Instruction_seq i))
: Q self_type A B i :=
let Q' st b A B : instruction_seq st b A B -> Type :=
if b return instruction_seq st b A B -> Type
then Q st A B
else fun i => True
in
match i as i0 in instruction_seq st b A B return Q' st b A B i0
with
| @SEQ _ A B C tff i1 i2 =>
(if tff return
forall i2 : instruction_seq _ tff B C,
Q' _ tff A C (SEQ i1 i2)
then
fun i2 =>
HSEQ _ _ _ _ i1 i2
(tail_fail_induction_seq _ B C i2 P Q HFAILWITH HIF HSEQ HTF HIS)
else fun i2 => I)
i2
| @Tail_fail _ A B i => HTF _ _ _ i (tail_fail_induction _ A B i P Q HFAILWITH HIF HSEQ HTF HIS)
| _ => I
end .
Corollary tail_fail_induction_and_seq
(P : forall self_type A B, instruction self_type true A B -> Type)
(Q : forall self_type A B, instruction_seq self_type true A B -> Type)
(HFAILWITH : forall st a A B, P st (a ::: A) B FAILWITH)
(HIF : forall st A B C1 C2 t (f : if_family C1 C2 t) i1 i2,
Q st (C1 ++ A)%list B i1 ->
Q st (C2 ++ A)%list B i2 ->
P st (t ::: A) B (IF_ f i1 i2))
(HSEQ : forall st A B C i1 i2,
Q st B C i2 -> Q st A C (SEQ i1 i2))
(HTF : forall st A B i, P st A B i -> Q st A B (Tail_fail i))
(HIS : forall st A B i, Q st A B i -> P st A B (Instruction_seq i))
: (forall self_type A B i, P self_type A B i) *
(forall self_type A B i, Q self_type A B i).
Proof.
split.
- intros; eapply tail_fail_induction; eassumption.
- intros; eapply tail_fail_induction_seq; eassumption.
Defined.
Definition tail_fail_change_range {self_type} A B B' (i : instruction self_type true A B) :
instruction self_type true A B'.
Proof.
apply (tail_fail_induction self_type A B i (fun self_type A B i => instruction self_type true A B')
(fun self_type A B i => instruction_seq self_type true A B')); clear A B i.
- intros st a A _.
apply FAILWITH.
- intros st A B C1 C2 t f _ _ i1 i2.
apply (IF_ f i1 i2).
- intros st A B C i1 _ i2.
apply (SEQ i1 i2).
- intros st A B _ i.
apply (Tail_fail i).
- intros st A B _ i.
apply (Instruction_seq i).
Defined.
Definition seq_aux {self_type A B C tffa tffb} :
instruction self_type tffa A B ->
instruction_seq self_type tffb B C ->
instruction_seq self_type (tffa || tffb)%bool A C :=
if tffa
return
(instruction self_type tffa A B ->
instruction_seq self_type tffb B C ->
instruction_seq self_type (tffa || tffb) A C)
then
fun i _ => Tail_fail (tail_fail_change_range A B C i)
else SEQ.
Coercion comparable_constant a := Comparable_constant a.
Definition full_contract tff param annot storage :=
instruction_seq (Some (param, annot)) tff
((pair param storage) ::: nil)
((pair (list operation) storage) ::: nil).
Record contract_file : Set :=
Mk_contract_file
{
contract_file_parameter : type;
contract_file_annotation : annot_o;
contract_file_storage : type;
contract_tff : Datatypes.bool;
contract_file_code :
full_contract
contract_tff
contract_file_parameter
contract_file_annotation
contract_file_storage;
}.
Notation "'IF'" := (IF_ IF_bool) : michelson_scope.
Notation "'IF_TRUE'" := (IF_ IF_bool) : michelson_scope.
Notation "'IF_LEFT'" := (IF_ (IF_or _ _ _ _)) : michelson_scope.
Notation "'IF_NONE'" := (IF_ (IF_option _)) : michelson_scope.
Notation "'IF_CONS'" := (IF_ (IF_list _)) : michelson_scope.
Notation "'LOOP'" := (LOOP_ LOOP_bool) : michelson_scope.
Notation "'LOOP_LEFT'" := (LOOP_ (LOOP_or _ _)) : michelson_scope.
Delimit Scope michelson_scope with michelson.
Bind Scope michelson_scope with instruction.
Bind Scope michelson_scope with instruction_seq.
Bind Scope michelson_scope with full_contract.
Definition instruction_wrap {A B : stack_type} {self_type tff}
: instruction self_type tff A B ->
instruction_seq self_type tff A B :=
if tff return instruction self_type tff A B -> instruction_seq self_type tff A B then
Tail_fail
else fun i => SEQ i NOOP.
Fixpoint instruction_app_aux
{A B C : stack_type} {self_type tff1 tff2}
(i1 : instruction_seq self_type tff1 A B) :
tff1 = false -> instruction_seq self_type tff2 B C -> instruction_seq self_type tff2 A C :=
match i1 with
| NOOP => fun _ i2 => i2
| SEQ i11 i12 =>
fun H i2 => SEQ i11 (instruction_app_aux i12 H i2)
| Tail_fail i =>
fun H => False_rec _ (Bool.diff_true_false H)
end.
Definition instruction_app {A B C : stack_type} {self_type tff}
(i1 : instruction_seq self_type false A B)
(i2 : instruction_seq self_type tff B C) :
instruction_seq self_type tff A C :=
instruction_app_aux i1 eq_refl i2.
Notation "A ;;; B" := (instruction_app A B) (at level 100, right associativity).
Notation "A ;; B" := (seq_aux A B) (at level 100, right associativity).
Notation "{ }" := NOOP : michelson_scope.
Notation "{ A ; .. ; B }" := (seq_aux A .. (seq_aux B NOOP) ..) : michelson_scope.
Notation "n ~Mutez" := (tez.valid_mutez (Hvalidt := I) (int64bv.of_Z_safe n eq_refl)) (at level 100).
Notation "n ~mutez" := (Comparable_constant mutez (n ~Mutez)) (at level 100).
Definition False := Comparable_constant bool false.
Definition True := Comparable_constant bool true.
(* Dig stuff *)
Lemma nltz : forall n: Datatypes.nat, (n ?= 0) <> Lt.
Proof. intros n H. rewrite Nat.compare_lt_iff in H. omega. Qed.
Lemma lt_S_n : forall n m, (S n ?= S m) = Lt -> (n ?= m) = Lt.
Proof. intros. rewrite Nat.compare_lt_iff in *. omega. Qed.
Fixpoint stacktype_split_dig (l : stack_type) (n : Datatypes.nat) : (n ?= List.length l) = Lt -> (stack_type * type * stack_type) :=
match l, n with
| List.nil, _ => (fun pf => match nltz n pf with end)
| List.cons x tl, 0 => (fun _ => (nil, x, tl))
| List.cons x xs', S n' => (fun pf => let '(l1, a, l2) := stacktype_split_dig xs' n' (lt_S_n n' (Datatypes.length xs') pf) in (List.cons x l1, a, l2))
end.
Lemma stacktype_split_dig_size : forall l n H,
let stack := stacktype_split_dig l n H in
(l = (List.app (fst (fst stack)) (List.cons (snd (fst stack)) (snd stack))) /\ List.length (fst (fst stack)) = n).
Proof.
induction l; intros n H; simpl in *.
- destruct nltz.
- destruct n.
+ simpl. auto.
+ specialize (IHl _ (lt_S_n _ _ H)).
destruct (stacktype_split_dig l n (lt_S_n n (length l) H)) as [[l1 t] l2]. simpl in *.
destruct IHl as [IHl1 IHlen]. subst. auto.
Qed.
Lemma length_app_cons_dig : forall n l1 l2 t,
n = Datatypes.length l1 ->
n ?= Datatypes.length (l1 +++ t ::: l2) = Lt.
Proof.
intros n l1 l2 t Hlen.
rewrite List.app_length. rewrite <- Hlen.
simpl. rewrite Nat.compare_lt_iff in *. omega.
Qed.
Lemma stacktype_dig_proof_irrelevant : forall l n Hlen1 Hlen2,
stacktype_split_dig l n Hlen1 = stacktype_split_dig l n Hlen2.
Proof.
induction l; intros n Hlen1 Hlen2.
- simpl. specialize (nltz _ Hlen1) as Hfalse. inversion Hfalse.
- simpl. destruct n. reflexivity.
erewrite IHl. erewrite IHl at 2. eauto.
Qed.
Lemma stacktype_split_dig_exact : forall l1 l2 t n (Hlen : n = Datatypes.length l1),
stacktype_split_dig (l1+++t:::l2) n (length_app_cons_dig _ l1 l2 t Hlen) = (l1, t, l2).
Proof.
induction l1; intros l2 t n Hlen; simpl.
- destruct n. reflexivity.
inversion Hlen.
- destruct n. inversion Hlen.
simpl in Hlen; inversion Hlen.
specialize (IHl1 l2 t n H0).
specialize (stacktype_dig_proof_irrelevant (l1+++t:::l2) n (length_app_cons_dig n l1 l2 t H0)
(lt_S_n n (Datatypes.length (l1 +++ t ::: l2))
(length_app_cons_dig (S n) (a ::: l1) l2 t Hlen))) as Hpi.
rewrite <- Hpi. rewrite IHl1. reflexivity.
Qed.
(* Dug stuff *)
Lemma Snltz {A} : forall n',
S n' ?= S (@Datatypes.length A nil) <> Lt.
Proof.
intros n' Hlen; simpl in *. rewrite Nat.compare_lt_iff in *. omega.
Qed.
Fixpoint stacktype_split_dug_aux (l : stack_type) (n : Datatypes.nat) : n ?= (S (List.length l)) = Lt -> (stack_type * stack_type) :=
match l, n with
| _, 0 => (fun _ => (nil, l))
| List.nil, S n' => (fun pf => match (Snltz n' pf) with end)
| List.cons x xs', S n' => (fun pf => let '(l1, l2) := stacktype_split_dug_aux xs' n' (lt_S_n n' (Datatypes.length (x::xs')) pf) in (List.cons x l1, l2))
end.
Definition stacktype_split_dug (l : stack_type) (n : Datatypes.nat) : n ?= (List.length l) = Lt -> (type * stack_type * stack_type) :=
match l with
| nil => (fun pf => match (nltz n pf) with end)
| List.cons x xs' => (fun pf => let '(l1, l2) := stacktype_split_dug_aux xs' n (lt_S_n n (Datatypes.length (x::xs')) pf) in (x, l1, l2))
end.
Lemma stacktype_split_dug_aux_size : forall l n H,
let stack := stacktype_split_dug_aux l n H in
(l = (List.app (fst stack) (snd stack)) /\ List.length (fst stack) = n).
Proof.
induction l; intros n H; simpl in *.
- destruct n; simpl in *; auto. destruct Snltz.
- destruct n.
+ simpl. auto.
+ specialize (IHl _ (lt_S_n _ _ H)).
destruct (stacktype_split_dug_aux l n (lt_S_n n (S (length l)) H)) as [l1 l2]. simpl in *.
destruct IHl as [IHl1 IHlen]. subst. auto.
Qed.
Lemma stacktype_dug_aux_proof_irrelevant : forall l n Hlen1 Hlen2,
stacktype_split_dug_aux l n Hlen1 = stacktype_split_dug_aux l n Hlen2.
Proof.
induction l; intros n Hlen1 Hlen2.
- simpl. destruct n.
reflexivity.
simpl in Hlen1. destruct Snltz.
- simpl. destruct n. reflexivity.
erewrite IHl. erewrite IHl at 2. eauto.
Qed.
Lemma stacktype_dug_proof_irrelevant : forall l n Hlen1 Hlen2,
stacktype_split_dug l n Hlen1 = stacktype_split_dug l n Hlen2.
Proof.
intros l n Hlen1 Hlen2.
destruct l; simpl.
- destruct nltz.
- rewrite (stacktype_dug_aux_proof_irrelevant l n (lt_S_n n (S (length l)) Hlen1) (lt_S_n n (S (length l)) Hlen2)).
reflexivity.
Qed.
Lemma stacktype_split_dug_size : forall l n H,
let stack := stacktype_split_dug l n H in
(l = (List.cons (fst (fst stack)) (List.app (snd (fst stack)) (snd stack))) /\ List.length (snd (fst stack)) = n).
Proof.
destruct l; intros n H; simpl in *.
- destruct nltz.
- specialize (stacktype_split_dug_aux_size l n H) as Hsize.
assert (stacktype_split_dug_aux l n H = stacktype_split_dug_aux l n (lt_S_n n (S (length l)) H)) as Hpi by apply stacktype_dug_aux_proof_irrelevant.
rewrite <- Hpi. destruct (stacktype_split_dug_aux l n H); simpl in *.
destruct Hsize. split; f_equal; auto.
Qed.
Lemma length_app_cons_dug : forall n l1 l2,
n = Datatypes.length l1 ->
n ?= S (Datatypes.length (l1 +++ l2)) = Lt.
Proof.
intros n l1 l2 Hlen.
simpl. rewrite List.app_length. rewrite <- Hlen.
rewrite Nat.compare_lt_iff.
omega.
Qed.
Lemma stacktype_split_dug_aux_exact : forall l1 l2 n (Hlen : n = Datatypes.length l1),
stacktype_split_dug_aux (l1+++l2) n (length_app_cons_dug _ l1 l2 Hlen) = (l1, l2).
Proof.
induction l1; intros l2 n Hlen; simpl.
- destruct n. induction l2; reflexivity.
inversion Hlen.
- destruct n. inversion Hlen.
simpl in Hlen; inversion Hlen.
specialize (IHl1 l2 n H0).
inversion Hlen.
specialize (stacktype_dug_aux_proof_irrelevant (l1+++l2) n (length_app_cons_dug n l1 l2 H0)) as Hpi.
rewrite <- Hpi. rewrite IHl1. reflexivity.
Qed.