[Next] [Up] [Previous] [Contents]
Next: Types Up: Abstract Syntax Previous: Abstract Syntax   Contents

Terms

The syntax of $ \alpha $Prolog terms is summarized by the following grammar:

$\displaystyle t$ $\displaystyle ::=$ $\displaystyle () \mid int \mid bool \mid char \mid string$  
  $\displaystyle \mid$ $\displaystyle c \mid f t_1 \cdots t_n \mid (t_1,\ldots,t_n) \mid [] \mid t{::}u \mid [t_1, \ldots , t_n] \mid [t_1, \ldots,t_n\vert t] \mid X \mid \_$  
  $\displaystyle \mid$ $\displaystyle \mathsf{n} \mid \mathsf{n} \backslash t \mid (\mathsf{n}$~$\displaystyle \mathsf{m})t$  


James Cheney 2003-10-23