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

..

tests

mk: mino + maxo — find min/max of a list

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

conda.sx

mk: phase 5A — conda, soft-cut without onceo

2026-05-07 21:51:52 +00:00

conde.sx

mk: phase 4A — appendo canary green, both directions

2026-05-07 20:24:42 +00:00

condu.sx

mk: phase 4A — appendo canary green, both directions

2026-05-07 20:24:42 +00:00

defrel.sx

mk: defrel — Prolog-style relation-definition macro

2026-05-08 11:27:49 +00:00

fd.sx

mk: phase 6A — minimal FD (ino + all-distincto)

2026-05-08 07:56:58 +00:00

fresh.sx

mk: phase 2B — fresh, defmacro form + call-fresh

2026-05-07 19:56:40 +00:00

goals.sx

mk: phase 2A — streams + ==/conj/disj, 34 new tests

2026-05-07 19:54:43 +00:00

intarith.sx

mk: mino + maxo — find min/max of a list

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

matche.sx

mk: matche keyword pattern fix + classic puzzles

2026-05-08 07:50:03 +00:00

nafc.sx

mk: phase 5C — nafc, negation as finite failure

2026-05-07 23:29:08 +00:00

peano.sx

mk: eveno + oddo — Peano parity predicates

2026-05-08 11:30:02 +00:00

project.sx

mk: phase 5B — project, escape into host SX

2026-05-07 23:27:16 +00:00

queens.sx

mk: 4-queens classic benchmark green

2026-05-08 10:41:02 +00:00

relations.sx

mk: subseto — every element of l1 is in l2

2026-05-08 12:09:06 +00:00

run.sx

mk: phase 3 — run* / run / reify, 18 new tests

2026-05-07 20:03:42 +00:00

stream.sx

mk: phase 4A — appendo canary green, both directions

2026-05-07 20:24:42 +00:00

unify.sx

mk: phase 4A — appendo canary green, both directions

2026-05-07 20:24:42 +00:00