giles 4f5f8015fb mk: mino + maxo — find min/max of a list ...

Two conde clauses each: singleton -> the element; multi -> compare head
against the recursive min/max of the tail and pick. Uses lteo-i / lto-i
for the comparisons, so the input must be ground integers.

mino + maxo can run together: (fresh (mn mx) (mino l mn) (maxo l mx)
(== q (list mn mx))) recovers both.

9 new tests, 472/472 cumulative.

2026-05-08 12:12:32 +00:00

846 B

Raw Blame History

View Raw