TBoS p.199,200
The example recurses through a tuple converting it into a list
(0-) (define tuple->list (@p X Y) -> [X | (tuple->list Y)] X -> [X]) (fn tuple->list) (1-) (tuple->list (@p 1 2 3)) [1 2 3]
4. The Core Language
4.6 Sequences
5 Defining Functions
6. Packages
7. Shen-YACC
8. Shen Prolog
9. Types
10 Sequent Calculus
10.2 Exotic Types
Built by Shen Technology (c) Mark Tarver, September 2021