Re: [isabelle] code generation for saturated naturals

Still one further remark:

I guess with lemmas like
  "nat_of (min x y) = min (nat_of x) (nat_of y)"
  "nat_of (max x y) = max (nat_of x) (nat_of y)"
  "nat_of (Inf A) = Min_fin (insert 0 (nat_of ` A))"
  "nat_of (Sup A) = Sup_fin (insert (len_of TYPE('a)) (nat_of ` A))"
life in the instances proofs can even be easier.




PGP available:

Attachment: signature.asc
Description: OpenPGP digital signature

This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.