Next: Constructing Recursive Data Structures:
Up: Adding Computation Domains: CLP
Previous: Constructing Recursive Data Structures:
- Note: there is an alternative notation for lists
- Examples:
- The list .(a, .(b, .(c, []))) is represented as [a,
b, c]
- The list .(a, .(b, X)) (free tail) is represented as
[a, b|X]
- Infix ``|'' stands for ``.''
- Implicit [] when all elements are specified
Last modification: Thu Oct 7 12:04:03 MEST 1999 <webmaster@clip.dia.fi.upm.es>