You are here: irt.org | FOLDOC | constructed type
<types> A type formed by applying some type constructor function to one or more other types. The usual constructions are
functions: t1 -> t2, products: (t1, t2), sums: t1 + t2 and
(In LaTeX, the lifted type is written with a subscript
See also algebraic data type, primitive type.
Nearby terms: Constraint Logic Programming « CONSTRAINTS « constraint satisfaction « constructed type » Constructive Cost Model » constructive proof » constructive solid geometry
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb