{- |

Module : $Header$

Copyright : (c) University of Cambridge, Cambridge, England

adaption (c) Till Mossakowski, Uni Bremen 2002-2004

Licence : similar to LGPL, see HetCATS/LICENCE.txt or LIZENZ.txt

Maintainer : hets@tzi.de

Stability : provisional

Portability : portable

Data structures for Isabelle sigantures and theories.

Adapted from Isabelle.

-}

{- list of datatype definitions

each of these consists of a list of (mututally recursive) datatypes

each datatype consists of its name (Typ) and a list of constructors

each constructor consists of its name (String) and list of argument types

-}

module Isabelle.IsaSign where

import qualified Common.Lib.Map as Map

import Common.Id

---------------- from src/Pure/Syntax/syntax.ML -------------------

type Syntax = () -- leave this for later

-------------------- from src/Pure/term.ML ------------------------

{-Indexnames can be quickly renamed by adding an offset to the integer part,

for resolution.-}

type Indexname = (String,Int)

{- Types are classified by sorts. -}

type Class = String;

type Sort = [Class]

{- The sorts attached to TFrees and TVars specify the sort of that variable -}

data Typ = Type (String,[Typ]) -- type constructor, with name and args

| TFree (String, Sort) -- free type variable ('a)

| TVar (Indexname, Sort) -- type unknown (?'a)

deriving (Eq, Ord)

infix -->

infix --->

noType :: Typ

noType = Type("noType",[])

boolType :: Typ

boolType = Type("bool",[])

mkOptionType :: Typ -> Typ

mkOptionType t = Type("option",[t])

mkProductType :: Typ -> Typ -> Typ

mkProductType t1 t2 = Type ("*",[t1,t2])

mkTypeAppl :: Typ -> Typ -> Typ

mkTypeAppl t1 t2 = Type ("typeAppl",[t1,t2])

s --> t = Type("fun",[s,t])

{-handy for multiple args: [T1,...,Tn]--->T gives T1-->(T2--> ... -->T)-}

(--->) = flip $ foldr (-->)

{-Terms. Bound variables are indicated by depth number.

Free variables, (scheme) variables and constants have names.

An term is "closed" if every bound variable of level "lev"

is enclosed by at least "lev" abstractions.

It is possible to create meaningless terms containing loose bound vars

or type mismatches. But such terms are not allowed in rules. -}

data Term =

Const (String, Typ) -- constants

| Free (String, Typ) -- free variables

-- | Var (Indexname, Typ)

-- | Bound Int

| Abs (Term, Typ, Term) -- lambda abstraction

| App Term Term -- application

| Case (Term, [(Term, Term)]) -- case

| If (Term, Term, Term) -- If then else

| Let ([(Term, Term)], Term) -- Let

deriving (Eq, Ord)

data Sentence = Sentence { senTerm :: Term }

instance Eq Sentence where

s1 == s2 = senTerm s1 == senTerm s2

instance Ord Sentence where

compare s1 s2 = compare (senTerm s1) (senTerm s2)

-------------------- from src/Pure/sorts.ML ------------------------

{-- type classes and sorts --}

{-

Classes denote (possibly empty) collections of types that are

partially ordered by class inclusion. They are represented

symbolically by strings.

Sorts are intersections of finitely many classes. They are

represented by lists of classes. Normal forms of sorts are sorted

lists of minimal classes (wrt. current class inclusion).

(already defined in Pure/term.ML)

-}

{- sort signature information -}

{-

classrel:

table representing the proper subclass relation; entries (c, cs)

represent the superclasses cs of c;

arities:

table of association lists of all type arities; (t, ars) means

that type constructor t has the arities ars; an element (c, Ss) of

ars represents the arity t::(Ss)c;

-}

type Classrel = Map.Map String [Class]

type Arities = Map.Map String [(Class, [Sort])]

-------------------- from src/Pure/type.ML ------------------------

data TypeSig =

TySg {

classes:: [Class],

classrel:: Classrel,

defaultSort:: Sort,

tycons:: Map.Map String Int, -- type constructor names, with arities

log_types:: [String],

univ_witness:: Maybe (Typ, Sort),

abbrs:: Map.Map String ([String],Typ),

arities:: Arities }

deriving (Eq)

emptyTypeSig :: TypeSig

emptyTypeSig = TySg {

classes = [],

classrel = Map.empty,

defaultSort = [],

tycons = Map.empty,

log_types = [],

univ_witness = Nothing,

abbrs = Map.empty,

arities = Map.empty }

-------------------- from src/Pure/sign.ML ------------------------

data Sign = Sign { baseSig :: String, -- like Pure, HOL, Main etc.

tsig :: TypeSig,

constTab :: Map.Map String Typ,

dataTypeTab :: DataTypeTab,

-- needs HOLCF, extend this with domains

syn :: Syntax,

showLemmas :: Bool

}

deriving (Eq)

{- list of datatype definitions

each of these consists of a list of (mututally recursive) datatypes

each datatype consists of its name (Typ) and a list of constructors

each constructor consists of its name (String) and list of argument types

-}

type DataTypeTab = [DataTypeTabEntry]

type DataTypeTabEntry = [(Typ,[DataTypeAlt])]

type DataTypeAlt = (String,[Typ])

emptySign :: Sign

emptySign = Sign { baseSig = "Pure",

tsig = emptyTypeSig,

constTab = Map.empty,

dataTypeTab = [],

syn = (),

showLemmas = False }