2014-06-26 16:12:27 +00:00
|
|
|
precedence `+`:65
|
|
|
|
|
|
|
|
namespace nat
|
2014-10-02 23:20:52 +00:00
|
|
|
constant nat : Type.{1}
|
|
|
|
constant add : nat → nat → nat
|
2014-06-26 16:12:27 +00:00
|
|
|
infixl + := add
|
2014-08-07 23:59:08 +00:00
|
|
|
end nat
|
2014-06-26 16:12:27 +00:00
|
|
|
|
|
|
|
namespace int
|
2014-09-03 23:00:38 +00:00
|
|
|
open nat (nat)
|
2014-10-02 23:20:52 +00:00
|
|
|
constant int : Type.{1}
|
|
|
|
constant add : int → int → int
|
2014-06-26 16:12:27 +00:00
|
|
|
infixl + := add
|
2014-10-02 23:20:52 +00:00
|
|
|
constant of_nat : nat → int
|
2014-06-26 16:12:27 +00:00
|
|
|
coercion of_nat
|
2014-08-07 23:59:08 +00:00
|
|
|
end int
|
2014-06-26 16:12:27 +00:00
|
|
|
|
2014-09-03 23:00:38 +00:00
|
|
|
open nat
|
|
|
|
open int
|
2014-06-26 16:12:27 +00:00
|
|
|
|
2014-10-02 23:20:52 +00:00
|
|
|
constants n m : nat
|
|
|
|
constants i j : int
|
2014-06-26 16:12:27 +00:00
|
|
|
|
|
|
|
-- 'Most recent' are always tried first
|
|
|
|
print raw i + n
|
|
|
|
-- So, in the following one int.add is tried first, and we
|
|
|
|
-- get int.add (int.of_nat n) (int.of_nat m)
|
|
|
|
check n + m
|
|
|
|
|
|
|
|
print ">>> Forcing nat notation"
|
|
|
|
-- Force natural numbers
|
|
|
|
check #nat n + m
|
|
|
|
|
|
|
|
-- Moving 'nat' to the 'front'
|
|
|
|
print ">>> Moving nat notation to the 'front'"
|
2014-09-03 23:00:38 +00:00
|
|
|
open nat
|
2014-06-26 16:12:27 +00:00
|
|
|
print raw i + n
|
|
|
|
check n + m
|