Why does Adam Chlipala use left-associated nested tuples to represent Ltac lists in CPDT?

Question

Via CpdtTactics.v:

[...] Succeed iff x is in the list ls, represented with left-associated nested tuples.

Ltac inList x ls := match ls with | x => idtac | (_, x) => idtac | (?LS, _) => inList x LS end.

This seems atypical. Doesn't the tail of the list conventionally go in the right-hand side of the tuple?

score 3 · Answer 1 · answered Oct 14 '18 at 12:58

3

Via private communication with Adam:

No, I can't think of any way to prefer one version over the other, actually. I just had to make some choice for that part of the book.

answered Oct 14 '18 at 12:58

Carl Patenaude Poulin

6,238
5
24
46

score 3 · Accepted Answer · answered Oct 17 '18 at 16:34

3

Somehow n-tuples are nested pairs associated to the left:

(x, y, z)

desugars to

pair (pair x y) z

And that's what we get if we want to write inList x (x, y, z).

answered Oct 17 '18 at 16:34

Li-yao Xia

31,896
2
33
56

Why does Adam Chlipala use left-associated nested tuples to represent Ltac lists in CPDT?

2 Answers2