replaced Sorts.DOMAIN by general Sorts.CLASS_ERROR;
add_types etc.: reject qualified dummy types -- prevents users from messing up some internal conventions;
(* Title: HOL/Tools/function_package/termination.ML
ID: $Id$
Author: Alexander Krauss, TU Muenchen
A package for general recursive function definitions.
Termination goals...
*)
signature FUNDEF_TERMINATION =
sig
val mk_total_termination_goal : FundefCommon.fundef_result -> term
val mk_partial_termination_goal : theory -> FundefCommon.fundef_result -> string -> term * term
end
structure FundefTermination : FUNDEF_TERMINATION =
struct
open FundefCommon
open FundefAbbrev
fun mk_total_termination_goal (data: fundef_result) =
let
val {R, f, ... } = data
val domT = domain_type (fastype_of f)
val x = Free ("x", domT)
in
Trueprop (mk_mem (x, Const (acc_const_name, fastype_of R --> HOLogic.mk_setT domT) $ R))
end
fun mk_partial_termination_goal thy (data: fundef_result) dom =
let
val {R, f, ... } = data
val domT = domain_type (fastype_of f)
val D = Sign.simple_read_term thy (Type.varifyT (HOLogic.mk_setT domT)) dom
val DT = type_of D
val idomT = HOLogic.dest_setT DT
val x = Free ("x", idomT)
val z = Free ("z", idomT)
val Rname = fst (dest_Const R)
val iRT = mk_relT (idomT, idomT)
val iR = Const (Rname, iRT)
val subs = HOLogic.mk_Trueprop
(Const ("Orderings.less_eq", DT --> DT --> boolT) $ D $
(Const (acc_const_name, iRT --> DT) $ iR))
|> Type.freeze
val dcl = mk_forall x
(mk_forall z (Logic.mk_implies (Trueprop (HOLogic.mk_mem (x, D)),
Logic.mk_implies (mk_relmem (z, x) iR,
Trueprop (mk_mem (z, D))))))
|> Type.freeze
in
(subs, dcl)
end
end