Calc
FreshVar()
FreshVars()
Inductive()
Lemma()
NewType()
PTheorem()
Proof
QExists()
QForAll()
QImplies()
Struct()
Theorem()
axiom()
cond()
define()
prove()
search()
simp()
has_type()
DeclareFunction()
Fin()
HasType()
Id()
Pi()
Program()
ProgramState
SubSort
TExists()
TForAll()
Telescope
Type
ann()
axiom_sig()
normalize()
open_binder()
prove_sig()
subsort_domain()
Tactic to check that an expression t0 has type T in a context ctx.
>>> x = smt.Int("x") >>> Nat = smt.Lambda([x], x >= 0) >>> has_type([(x, Nat)], x+1, Nat) |= Implies(And(x >= 0), Lambda(x, x >= 0)[x + 1])
ctx (Telescope)
t0 (ExprRef)
T (SubSort)