Nominal/Ex/SingleLet.thy
author Christian Urban <urbanc@in.tum.de>
Thu, 27 May 2010 18:30:26 +0200
changeset 2200 31f1ec832d39
parent 2146 a2f70c09e77d
child 2213 231a20534950
child 2303 c785fff02a8f
permissions -rw-r--r--
fixed bug where perm_simp 'forgets' how to prove equivariance for the empty set

theory SingleLet
imports "../NewParser"
begin

atom_decl name

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
and assg =
  As "name" "trm"
binder
  bn::"assg \<Rightarrow> atom set"
where
  "bn (As x t) = {atom x}"

ML {* Inductive.the_inductive *}
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}) *}
thm trm_assg.fv[simplified trm_assg.supp(1-2)]


end