(*  Title:      quotient_def.thy

    Author:     Cezary Kaliszyk and Christian Urban

    Definitions for constants on quotient types.

*)

signature QUOTIENT_DEF =

sig

    local_theory -> (term * thm) * local_theory

    local_theory -> (term * thm) * local_theory

end;

structure Quotient_Def: QUOTIENT_DEF =

struct

open Quotient_Info;

open Quotient_Term;

(** Interface and Syntax Setup **)

(* The ML-interface for a quotient definition takes

   as argument:

    - the new constant as term

    - the rhs of the definition as term

   It returns the defined constant and its definition

   theorem; stores the data in the qconsts data slot.

*)

let

  val (lhs_str, lhs_ty) = dest_Free lhs handle TERM _ => error "Constant already defined."

  val _ = if null (strip_abs_vars rhs) then () else error "The definiens cannot be an abstraction"

  val absrep_trm = absrep_fun AbsF lthy (fastype_of rhs, lhs_ty) $ rhs

  val prop = Logic.mk_equals (lhs, Syntax.check_term lthy absrep_trm)

  val (_, prop') = LocalDefs.cert_def lthy prop

  val (_, newrhs) = Primitive_Defs.abs_def prop'

  val ((trm, (_ , thm)), lthy') = Local_Theory.define ((qconst_bname, mx), (attr, newrhs)) lthy

  (* data storage *)

  fun qcinfo phi = transform_qconsts phi {qconst = trm, rconst = rhs, def = thm}

  fun trans_name phi = (fst o dest_Const o #qconst) (qcinfo phi)

  val lthy'' = Local_Theory.declaration true

                 (fn phi => qconsts_update_gen (trans_name phi) (qcinfo phi)) lthy'

in

  ((trm, thm), lthy'')

end

let

  val lhs = Syntax.read_term lthy lhs_str

  val rhs = Syntax.read_term lthy rhs_str

  val lthy' = Variable.declare_term lhs lthy

  val lthy'' = Variable.declare_term rhs lthy'

in

end

val quotdef_parser =

val _ =

  OuterSyntax.local_theory "quotient_definition"

    "definition for constants over the quotient type"

      OuterKeyword.thy_decl (quotdef_parser >> (snd oo quotdef_cmd))

end; (* structure *)