| Symbol | Specification | Kind | Type |
|---|
| # . | array | f | array('a) → nat |
| #c . | matrix | f | matrix('a) → nat |
| #clean0rows | ShearSort | f | matrix(tord) × tord → nat |
| #clean1rows | ShearSort | f | matrix(tord) × tord → nat |
| #dirtyrows | ShearSort | f | matrix(tord) × tord → nat |
| #oc | list-as-arrayinstance | f | 'a × array('a) → nat |
| #r . | matrix | f | matrix('a) → nat |
| . % . | nat-div | pf | nat × nat → nat with λ n, m. m ≠ 0 |
| . ' | list-as-arrayinstance | f | 'a → array('a) |
| . * . | nat-mult | f | nat × nat → nat |
| . + . | nat-basic | f | nat × nat → nat |
| . + . | list-as-arrayinstance | f | array('a) × array('a) → array('a) |
| . + . | list-as-arrayinstance | f | array('a) × 'a → array('a) |
| . + . | array-listops | f | 'a × array('a) → array('a) |
| . ++ . | list-as-arrayinstance | f | array('a) × 'a → array('a) |
| . +1 | nat-basic | f | nat → nat |
| . +2 . | list-as-arrayinstance | f | 'a × 'a → array('a) |
| . - . | nat | pf | nat × nat → nat with λ n, m. n ≥ m |
| . -1 | nat-basic | pf | nat → nat with λ n. n ≠ 0 |
| . -1l . | list-as-arrayinstance | f | array('a) × 'a → array('a) |
| . -l . | list-as-arrayinstance | f | array('a) × 'a → array('a) |
| . -p . | list-as-arrayinstance | f | array('a) × nat → array('a) |
| . .butlast | list-as-arrayinstance | pf | array('a) → array('a) with λ x. x ≠ [] |
| . .dirtyrows≤ ( . ) | ShearSort | p | matrix(tord) × nat |
| . .first | array-listops | pf | array('a) → 'a with λ ar. ar ≠ [] |
| . .foldLeft ( . ) | list-as-arrayinstance | f | array('a) × 'b × ('b × 'a → 'b) → 'b |
| . .last | list-as-arrayinstance | pf | array('a) → 'a with λ x. x ≠ [] |
| . .rest | array-listops | pf | array('a) → array('a) with λ ar. ar ≠ [] |
| . .toArc | rowcol-upd | f | matrix('a) → array('a) |
| . .toArr | rowcol-upd | f | matrix('a) → array('a) |
| . / . | nat-div | pf | nat × nat → nat with λ n, m. m ≠ 0 |
| . /↑ . | ShearSort | pf | nat × nat → nat with λ m, n. n ≠ 0 |
| . < . | nat-basic | p | nat × nat |
| . < . | array-listops | p | array('a) × array('a) |
| . < . | tord | p | tord × tord |
| . > . | nat | p | nat × nat |
| . [ . ] | matrix | pf | matrix('a) × nat × nat → 'a with λ mx, r, c. r < #r mx ∧ c < #c mx |
| . [ . ] | matrix | pf | matrix('a) × nat × nat × 'a → matrix('a) with λ mx, r, c, a. r < #r mx ∧ c < #c mx |
| . [ . ] | array | pf | array('a) × nat → 'a with λ ar, n. n < # ar |
| . [ . ] | array | pf | array('a) × nat × 'a → array('a) with λ ar, n, a. n < # ar |
| . [ . ]c | matrix+array | pf | matrix('a) × nat → array('a) with λ mx, c. c < #c mx |
| . [ . ]c | rowcol-upd | pf | matrix('a) × nat × array('a) → matrix('a) with λ mx, c, a. c < #c mx ∧ # a = #r mx |
| . [ . ]r | matrix+array | pf | matrix('a) × nat → array('a) with λ mx, r. r < #r mx |
| . [ . ]r | rowcol-upd | pf | matrix('a) × nat × array('a) → matrix('a) with λ mx, r, a. r < #r mx ∧ # a = #c mx |
| . [ . ]rv | matrix-revops | pf | matrix('a) × nat × nat → 'a with λ mx, c, r. c < #c mx ∧ r < #r mx |
| . [ . ]rv | matrix-revops | pf | matrix('a) × nat × nat × 'a → matrix('a) with λ mx, c, r, a. c < #c mx ∧ r < #r mx |
| . \ . | list-as-arrayinstance | f | array('a) × array('a) → array('a) |
| . ^ . | nat-pot | f | nat × nat → nat |
| . ∈ . | list-as-arrayinstance | p | 'a × array('a) |
| . ∪ . | list-as-arrayinstance | f | array('a) × array('a) → array('a) |
| . ≤ . | nat | p | nat × nat |
| . ≥ . | nat | p | nat × nat |
| . ⊆ . | list-as-arrayinstance | p | array('a) × array('a) |
| . ⊆m . | list-as-arrayinstance | p | array('a) × array('a) |
| . ⊑ . | list-as-arrayinstance | p | array('a) × array('a) |
| . ⊒ . | list-as-arrayinstance | p | array('a) × array('a) |
| . map . | list-as-arrayinstance | f | array('a) × ('a → 'b) → array('b) |
| [] | array-listops | c | array('a) |
| 2^ . | nat-pot | f | nat → nat |
| ASC | ShearSort | v | bool,flexible |
| C | ShearSort | v | nat,flexible |
| M | ShearSort | v | nat,flexible |
| MX | ShearSort | v | matrix(tord),flexible |
| N | ShearSort | v | nat,flexible |
| ORD | ShearSort | v | tord × tord → bool,flexible |
| R | ShearSort | v | nat,flexible |
| a | ShearSort | v | array(tord) |
| all< | oarray-sort | p | array(tord) × tord |
| all< | oarray-sort | p | array(tord) × nat × nat × tord |
| all> | oarray-sort | p | array(tord) × tord |
| all> | oarray-sort | p | array(tord) × nat × nat × tord |
| all≤ | oarray-sort | p | array(tord) × tord |
| all≤ | oarray-sort | p | array(tord) × nat × nat × tord |
| all≥ | oarray-sort | p | array(tord) × tord |
| all≥ | oarray-sort | p | array(tord) × nat × nat × tord |
| array | array | s | |
| asc | ShearSort | v | bool |
| bound | ShearSort | v | nat |
| butlastn | list-as-arrayinstance | pf | nat × array('a) → array('a) with λ n, x. n ≤ # x |
| c | ShearSort | v | nat |
| cmp | array-copy | p | array('a) × 'a |
| cmp | array-copy | pp | array('a) × nat × array('a) × nat × nat with λ ar, m, ar0, m0, n. m + n ≤ # ar ∧ m0 + n ≤ # ar0 |
| cmp | array-copy | pp | array('a) × 'a × nat × nat with λ ar, a, m, n. m + n ≤ # ar |
| colsorted | ShearSort | p | matrix(tord) × nat × matrix(tord) |
| copy | array-copy | pf | array('a) × nat × array('a) × nat × nat → array('a) with λ ar, m, ar0, m0, n. m + n ≤ # ar ∧ m0 + n ≤ # ar0 |
| count | oarray-sort | f | array('a) × ('a → bool) → nat |
| count | oarray-sort | pf | array('a) × nat × nat × ('a → bool) → nat with λ x, m, n, p. m ≤ n ∧ n ≤ # x |
| countevn | ShearSort | f | array(tord) × (tord → bool) → nat |
| countevn | ShearSort | pf | array(tord) × nat × nat × (tord → bool) → nat with λ a, m, n, p. m ≤ n ∧ n ≤ # a |
| countodd | ShearSort | f | array(tord) × (tord → bool) → nat |
| countodd | ShearSort | pf | array(tord) × nat × nat × (tord → bool) → nat with λ a, m, n, p. m ≤ n ∧ n ≤ # a |
| disj | list-as-arrayinstance | p | array('a) × array('a) |
| dups | list-as-arrayinstance | p | array('a) |
| even | nat-even | p | nat |
| fill | array-copy | f | array('a) × 'a → array('a) |
| fill | array-copy | pf | array('a) × 'a × nat × nat → array('a) with λ ar, a, n, m. n + m ≤ # ar |
| fillfirst | list-as-arrayinstance | f | nat × 'a × array('a) → array('a) |
| filter | list-as-arrayinstance | f | array('a) × array('a) → array('a) |
| filter | oarray-sort | f | array('a) × ('a → bool) → array('a) |
| firstn | list-as-arrayinstance | pf | nat × array('a) → array('a) with λ n, x. n ≤ # x |
| frome | list-as-arrayinstance | f | array('a) × 'a → array('a) |
| i | ShearSort | v | tord |
| id○ | array-copy | p | array('a) × array('a) × nat |
| id○ | array-copy | p | array('a) × array('a) × nat × nat |
| idrange | array-copy | pp | array('a) × nat × nat with λ ar, m, n. m + n ≤ # ar |
| ins≤ | oarray-sort | f | tord × array(tord) → array(tord) |
| ins≥ | Bubblesort-row-rev | f | tord × array(tord) → array(tord) |
| j | ShearSort | v | tord |
| lastn | list-as-arrayinstance | pf | nat × array('a) → array('a) with λ n, x. n ≤ # x |
| log | nat-pot | pf | nat × nat → nat with λ m, m0. m0 ≠ 0 |
| log2 . | nat-pot | pf | nat → nat with λ m0. m0 ≠ 0 |
| log2↑ | ShearSort | f | nat → nat |
| m | ShearSort | v | nat |
| matrix | matrix | s | |
| max | tord-min-max | f | tord × tord → tord |
| max | nat-even | f | nat × nat → nat |
| max | oarray-sort | pf | array(tord) → tord with λ x. x ≠ [] |
| merge | oarray-sort | f | array(tord) × array(tord) → array(tord) |
| mergerev | Bubblesort-row-rev | f | array(tord) × array(tord) → array(tord) |
| min | tord-min-max | f | tord × tord → tord |
| min | nat-even | f | nat × nat → nat |
| min | oarray-sort | pf | array(tord) → tord with λ x. x ≠ [] |
| mkarray | array | f | nat → array('a) |
| mklist | list-as-arrayinstance | f | 'a × nat → array('a) |
| mkmatrix | matrix | f | nat × nat × 'a → matrix('a) |
| mx | ShearSort | v | matrix(tord) |
| n | ShearSort | v | nat |
| nat | nat-basic | s | |
| odd | nat-even | p | nat |
| ordered< | oarray-sort | p | array(tord) |
| ordered> | Bubblesort-row-rev | p | array(tord) |
| ordered≤ | oarray-sort | p | array(tord) |
| ordered≥ | Bubblesort-row-rev | p | array(tord) |
| p | ShearSort | v | tord → bool |
| perm | list-as-arrayinstance | p | array('a) × array('a) |
| pos | list-as-arrayinstance | f | 'a × array('a) → nat |
| pshearsort# | ShearSort | pr | : matrix(tord) (nondeterministic) |
| psortcol# | Bubblesort-col | pr | nat : matrix(tord) |
| psortcols# | ShearSort | pr | : matrix(tord) (nondeterministic) |
| psortrow# | Bubblesort-row | pr | nat : matrix(tord) |
| psortrowrev# | Bubblesort-row-rev | pr | nat : matrix(tord) |
| psortrows# | ShearSort | pr | : matrix(tord) (nondeterministic) |
| psortrowsnake# | ShearSort | pr | nat × bool : matrix(tord) (nondeterministic) |
| psortrowssnake# | ShearSort | pr | : matrix(tord) (nondeterministic) |
| r | ShearSort | v | nat |
| restn | list-as-arrayinstance | pf | nat × array('a) → array('a) with λ n, x. n ≤ # x |
| rev | list-as-arrayinstance | f | array('a) → array('a) |
| rmdup | list-as-arrayinstance | f | array('a) → array('a) |
| rowsincreasing | ShearSort | p | matrix(tord) × nat |
| sort | oarray-sort | f | array(tord) → array(tord) |
| sortrev | Bubblesort-row-rev | f | array(tord) → array(tord) |
| srowsorted | ShearSort | p | matrix(tord) × nat × matrix(tord) |
| subarray | array-copy | pf | array('a) × nat × nat → array('a) with λ ar, m, n. m + n ≤ # ar |
| sublist | list-as-arrayinstance | pf | nat × nat × array('a) → array('a) with λ n, m, x. n + m ≤ # x |
| toArc | rowcol-upd | f | matrix('a) × nat → array('a) |
| toArr | rowcol-upd | f | matrix('a) × nat → array('a) |
| tord | tord | s | |