# HG changeset patch # User wenzelm # Date 1298306603 -3600 # Node ID c3aa3c87ef218bc3023926d9498ec1d11ab7a2e5 # Parent 0c6093d596d636d078810a2a0602a27bf4a57689 modernized specifications; diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/CK_Machine.thy --- a/src/HOL/Nominal/Examples/CK_Machine.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/CK_Machine.thy Mon Feb 21 17:43:23 2011 +0100 @@ -380,7 +380,7 @@ text {* Typing Contexts *} -types tctx = "(name\ty) list" +type_synonym tctx = "(name\ty) list" text {* Sub-Typing Contexts *} diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/Class1.thy --- a/src/HOL/Nominal/Examples/Class1.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/Class1.thy Mon Feb 21 17:43:23 2011 +0100 @@ -2912,9 +2912,8 @@ text {* typing contexts *} -types - ctxtn = "(name\ty) list" - ctxtc = "(coname\ty) list" +type_synonym ctxtn = "(name\ty) list" +type_synonym ctxtc = "(coname\ty) list" inductive validc :: "ctxtc \ bool" diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/Crary.thy --- a/src/HOL/Nominal/Examples/Crary.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/Crary.thy Mon Feb 21 17:43:23 2011 +0100 @@ -25,8 +25,8 @@ | App "trm" "trm" ("App _ _" [110,110] 100) | Const "nat" -types Ctxt = "(name\ty) list" -types Subst = "(name\trm) list" +type_synonym Ctxt = "(name\ty) list" +type_synonym Subst = "(name\trm) list" lemma perm_ty[simp]: diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/Fsub.thy --- a/src/HOL/Nominal/Examples/Fsub.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/Fsub.thy Mon Feb 21 17:43:23 2011 +0100 @@ -84,7 +84,7 @@ VarB vrs ty | TVarB tyvrs ty -types env = "binding list" +type_synonym env = "binding list" text {* Typing contexts are represented as lists that ``grow" on the left; we thereby deviating from the convention in the POPLmark-paper. The lists contain diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/LocalWeakening.thy --- a/src/HOL/Nominal/Examples/LocalWeakening.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/LocalWeakening.thy Mon Feb 21 17:43:23 2011 +0100 @@ -81,7 +81,7 @@ text {* valid contexts *} -types cxt = "(name\ty) list" +type_synonym cxt = "(name\ty) list" inductive valid :: "cxt \ bool" diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/Pattern.thy --- a/src/HOL/Nominal/Examples/Pattern.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/Pattern.thy Mon Feb 21 17:43:23 2011 +0100 @@ -138,7 +138,7 @@ lemma pat_type_perm_eq: "pat_type ((pi :: name prm) \ p) = pat_type p" by (induct p) (simp_all add: perm_type) -types ctx = "(name \ ty) list" +type_synonym ctx = "(name \ ty) list" inductive ptyping :: "pat \ ty \ ctx \ bool" ("\ _ : _ \ _" [60, 60, 60] 60) diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/Type_Preservation.thy --- a/src/HOL/Nominal/Examples/Type_Preservation.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/Type_Preservation.thy Mon Feb 21 17:43:23 2011 +0100 @@ -58,7 +58,7 @@ text {* Typing Contexts *} -types ctx = "(name\ty) list" +type_synonym ctx = "(name\ty) list" abbreviation "sub_ctx" :: "ctx \ ctx \ bool" ("_ \ _") diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Examples/W.thy --- a/src/HOL/Nominal/Examples/W.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Examples/W.thy Mon Feb 21 17:43:23 2011 +0100 @@ -53,7 +53,7 @@ where "Let x be t1 in t2 \ trm.Let x t2 t1" -types +type_synonym Ctxt = "(var\tyS) list" text {* free type variables *} @@ -173,7 +173,7 @@ text {* Substitution *} -types Subst = "(tvar\ty) list" +type_synonym Subst = "(tvar\ty) list" consts psubst :: "Subst \ 'a \ 'a" ("_<_>" [100,60] 120) diff -r 0c6093d596d6 -r c3aa3c87ef21 src/HOL/Nominal/Nominal.thy --- a/src/HOL/Nominal/Nominal.thy Mon Feb 21 11:50:38 2011 +0100 +++ b/src/HOL/Nominal/Nominal.thy Mon Feb 21 17:43:23 2011 +0100 @@ -15,7 +15,7 @@ section {* Permutations *} (*======================*) -types +type_synonym 'x prm = "('x \ 'x) list" (* polymorphic constants for permutation and swapping *)