3 ms·

Implementing the comparisons by hand seems difficult and primitive. May I suggest introducing some helpful sub-packages and building the solution on top of thos

Implementing the comparisons by hand seems difficult and primitive. May I suggest introducing some helpful sub-packages and building the solution on top of those. For instance, is-odd would be implemented by using is-one, is-three, is-five, is-seven, etc.

leeoniya 3y ago
and is-one should be implemented by negating is-two, is-three, and so forth
- paddy_m 3y ago
  I read some text where a cheme was implemented such that numbers were `2 = 1+1`, `3 = 2+ 1`...
  - jcparkyn 3y ago
    Probably Peano numbers. https://wiki.haskell.org/Peano_numbers https://wiki.haskell.org/Peano_numbers
    - ta8903 3y ago
      >Succ Peano ...
      - remexre 3y ago
        The standard joke about my university's grad-level programming languages course is that its formalization unit does a great job of identifying undergrads by discussing Peano naturals and Hoare logic in the same lecture...
  - jbboehr 3y ago
    Perhaps Nock: https://developers.urbit.org/reference/nock/definition https://developers.urbit.org/reference/nock/definition > The reader might wonder how an interpreter whose only arithmetic operation is increment can ever be practical. > The short answer is that a Nock interpreter doesn't have to use the algorithm above. It just has to get the same result as the algorithm above.