src/ZF/ex/comb.ML
author lcp
Thu Sep 30 10:54:01 1993 +0100 (1993-09-30)
changeset 16 0b033d50ca1c
parent 0 a5a9c433f639
child 71 729fe026c5f3
permissions -rw-r--r--
ex/{bin.ML,comb.ML,prop.ML}: replaced NewSext by Syntax.simple_sext
ex/prop-log/hyps_thms_if: split up the fast_tac call for more speed
called expandshort
clasohm@0
     1
(*  Title: 	ZF/ex/comb.ML
clasohm@0
     2
    ID:         $Id$
clasohm@0
     3
    Author: 	Lawrence C Paulson
clasohm@0
     4
    Copyright   1993  University of Cambridge
clasohm@0
     5
clasohm@0
     6
Datatype definition of combinators S and K
clasohm@0
     7
clasohm@0
     8
J. Camilleri and T. F. Melham.
clasohm@0
     9
Reasoning with Inductively Defined Relations in the HOL Theorem Prover.
clasohm@0
    10
Report 265, University of Cambridge Computer Laboratory, 1992.
clasohm@0
    11
*)
clasohm@0
    12
clasohm@0
    13
clasohm@0
    14
(*Example of a datatype with mixfix syntax for some constructors*)
clasohm@0
    15
structure Comb = Datatype_Fun
clasohm@0
    16
 (val thy = Univ.thy;
clasohm@0
    17
  val rec_specs = 
clasohm@0
    18
      [("comb", "univ(0)",
clasohm@0
    19
	  [(["K","S"],	"i"),
clasohm@0
    20
	   (["op #"],	"[i,i]=>i")])];
clasohm@0
    21
  val rec_styp = "i";
lcp@16
    22
  val ext = Some (Syntax.simple_sext [Infixl("#", "[i,i] => i", 90)]);
clasohm@0
    23
  val sintrs = 
clasohm@0
    24
	  ["K : comb",
clasohm@0
    25
	   "S : comb",
clasohm@0
    26
	   "[| p: comb;  q: comb |] ==> p#q : comb"];
clasohm@0
    27
  val monos = [];
clasohm@0
    28
  val type_intrs = data_typechecks;
clasohm@0
    29
  val type_elims = []);
clasohm@0
    30
clasohm@0
    31
val [K_comb,S_comb,Ap_comb] = Comb.intrs;
clasohm@0
    32
clasohm@0
    33
val Ap_E = Comb.mk_cases Comb.con_defs "p#q : comb";
clasohm@0
    34