Tutorial/Minimal.thy
author Christian Urban <urbanc@in.tum.de>
Mon, 04 Jun 2012 21:39:51 +0100
changeset 3183 313e6f2cdd89
parent 3132 87eca760dcba
child 3235 5ebd327ffb96
permissions -rw-r--r--
added permutation simplification to the simplifier; this makes the simplifier more powerful, but it potentially loops more often

theory Minimal
imports "Nominal2"
begin

atom_decl name

nominal_datatype lam =
  Var "name"
| App "lam" "lam"
| Lam x::"name" l::"lam"  binds x in l ("Lam [_]. _" [100, 100] 100)



lemma alpha_test:
  shows "Lam [x]. (Var x) = Lam [y]. (Var y)"
  by (simp add: lam.eq_iff Abs1_eq_iff lam.fresh fresh_at_base)

end