Nominal/Ex/SingleLet.thy
author Christian Urban <urbanc@in.tum.de>
Wed, 09 Jun 2010 15:14:16 +0200
changeset 2313 25d2cdf7d7e4
parent 2312 ad03df7e8056
child 2316 08bbde090a17
permissions -rw-r--r--
transitivity proofs done

theory SingleLet
imports "../NewParser"
begin


atom_decl name

declare [[STEPS = 11]]

nominal_datatype trm =
  Var "name"
| App "trm" "trm"
| Lam x::"name" t::"trm"  bind_set x in t
| Let a::"assg" t::"trm"  bind_set "bn a" in t
| Foo x::"name" y::"name" t::"trm" t1::"trm" t2::"trm" bind_set x in y t t1 t2
| Bar x::"name" y::"name" t::"trm" bind y x in t x y
and assg =
  As "name" "name" "trm" "name"
binder
  bn::"assg \<Rightarrow> atom set"
where
  "bn (As x y t z) = {atom x}"


thm trm_assg.fv
thm trm_assg.supp
thm trm_assg.eq_iff
thm trm_assg.bn
thm trm_assg.perm
thm trm_assg.induct
thm trm_assg.inducts
thm trm_assg.distinct
ML {* Sign.of_sort @{theory} (@{typ trm}, @{sort fs}) *}

(* TEMPORARY
thm trm_assg.fv[simplified trm_assg.supp(1-2)]
*)

end