You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the suc (suc n) case of s[ssn-ssn/2]=ssssn-ssssn/2, the code simply recursively calls itself and typechecks, which implies that s[ssn-ssn/2]=ssssn-ssssn/2 2 should have the same type with s[ssn-ssn/2]=ssssn-ssssn/2 0. However seeing from the tests below, s[ssn-ssn/2]=ssssn-ssssn/2 0 should have the type 2 = 2 and s[ssn-ssn/2]=ssssn-ssssn/2 2 should have the type 3 = 3 which are clearly different types of =.
The text was updated successfully, but these errors were encountered:
This is another issue I encountered while trying to complete the last exercise in Universes, Induction, Specifications - Arend Theorem Prover.
In the
suc (suc n)
case ofs[ssn-ssn/2]=ssssn-ssssn/2
, the code simply recursively calls itself and typechecks, which implies thats[ssn-ssn/2]=ssssn-ssssn/2 2
should have the same type withs[ssn-ssn/2]=ssssn-ssssn/2 0
. However seeing from the tests below,s[ssn-ssn/2]=ssssn-ssssn/2 0
should have the type2 = 2
ands[ssn-ssn/2]=ssssn-ssssn/2 2
should have the type3 = 3
which are clearly different types of=
.The text was updated successfully, but these errors were encountered: