17 void freeKindDeep(
Kind*);
18 void freeKStarDeep(
Kstar);
19 void freeKpiDeep(
Kpi);
21 void freeTypeDeep(
Type*);
22 void freeVarParts(
Tvar);
23 void freeAllParts(
Tall);
24 void freeAppParts(
Tapp);
25 void freeExiParts(
Texi);
26 void freeAndParts(
Tand);
27 void freeOrParts(
Tor);
28 void freeBotParts(
Tbot);
30 void freeTermDeep(
Term*);
31 void freeMVarParts(
Mvar t);
32 void freeMAppParts(
Mapp t);
33 void freeMLamParts(
Mlam t);
34 void freeMWitParts(
Mwit t);
35 void freeMAbsParts(
Mabs t);
36 void freeMTupParts(
Mtup t);
37 void freeMPi1Parts(
Mpi1 t);
38 void freeMPi2Parts(
Mpi2 t);
39 void freeMIn1Parts(
Min1 t);
40 void freeMIn2Parts(
Min2 t);
41 void freeCasInParts(
McasIn t);
42 void freeMCasParts(
Mcas t);
43 void freeMEpsParts(
Meps t);
45 void freeAnyDeep(
Any*);
46 void freeAnyBindParts(
Bind b);
48 void freeNameDeep(
Name*);
The representation of the pi Kind.
Definition: checker.h:61
The representation of the abstraction (i.e. existential quantifier elimination) Term.
Definition: checker.h:211
The representation of the case subexpression.
Definition: checker.h:261
The representation of the universal quantifier Type.
Definition: checker.h:95
The representation of the exists (i.e. existential quantifier introduction) Term. ...
Definition: checker.h:201
The representation of the first injection (i.e. disjunction introduction) Term.
Definition: checker.h:246
The representation of the application of Type to Term; it is one of the species of Type...
Definition: checker.h:104
The representation of the kinds in the typesystem.
Definition: checker.h:68
The representation of the application of a Term to a Term; it is one of the species of Term...
Definition: checker.h:185
The representation of the conjunction Type.
Definition: checker.h:119
Definitions of the base structures that represent the formulas and proofs.
The representation of the tuple (i.e. conjunction introduction) Term.
Definition: checker.h:223
The representation of the existential quantifier Type.
Definition: checker.h:111
The representation of the bottom/falsity Type.
Definition: checker.h:133
The representation of the second injection (i.e. disjunction introduction) Term.
Definition: checker.h:254
The representation of the case analysis (i.e. disjunction elimination) Term.
Definition: checker.h:269
The representation of the types in the typesystem.
Definition: checker.h:146
The representation of the first projection (i.e. conjunction elimination) Term.
Definition: checker.h:232
The representation of the type variable in Type.
Definition: checker.h:88
The representation of the proof term variable/axiom in Term.
Definition: checker.h:178
The representation of the ex falso quod libet (i.e. falsity elimination) Term.
Definition: checker.h:278
The representation of the disjunction Type.
Definition: checker.h:126
The representation of the star Kind.
Definition: checker.h:57
The wrapper that makes it possible to store in envmap different species of elements that occur in typ...
Definition: checker.h:329
The representation of the proof terms in the typesystem.
Definition: checker.h:298
char * Name
The type to structurally represent identifier names.
Definition: checker.h:46
The representation of the second projection (i.e. conjunction elimination) Term.
Definition: checker.h:239
The representation of the lambda abstraction Term.
Definition: checker.h:192
The structure to represent binders. (For future use.)
Definition: checker.h:315