Lines Matching defs:types
25 The data types in \texttt{As.hs} usually contain alternatives (Haskell
34 order -- kinds, types and terms, where predicate types and formulas are
35 special cases of types and terms respectively.
37 Kinds are constructed from classes, types from type
56 kind or class denotes a set of types or type constructors. A class maybe
62 because types within downsets may also be compound ids.
101 ids, but in order to avoid a mixfix analysis for types, they should be
102 simple ids. Instead the parser resolves types as follows:
177 \item A type pattern may be a type alias. When comparing types these aliases
192 \subsection{Data types}
208 types. (Laziness is ignored during unification.)
260 \item[ParseTerm.hs] parsing classes, types, terms and formulas
264 \item[TypeAna.hs] analyse types
266 \item[Unify.hs] unification of types