Last active
August 27, 2022 23:31
-
-
Save haylinmoore/ba27ca94986ba8f21fb437606900aaff to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
let replicate | |
: forall (a : Type) . Natural -> a -> List a | |
= \n -> \x -> Natural/fold n (\xs -> [ x ] + xs) [] | |
let generate | |
: forall (a : Type) . Natural -> (Natural -> a) -> List a | |
= \n -> \f -> List/map (\x -> f x.index) (List/indexed (replicate n { })) | |
let divide: | |
Natural -> Natural -> Natural -> Real -> Real | |
= \x -> \y -> \scale -> \inc -> | |
let xb = x*scale | |
# Get a list of numbers 0, y, 2*y, y*3, ... y*xb | |
let l = generate xb (\xs -> (xs)*y) : List Natural | |
# Add by inc for each value less than x * scale | |
let d = List/fold { cons: \next -> \acc -> | |
let next = next : Natural | |
in if Real/lessThan next xb | |
then acc+inc | |
else acc | |
, nil: 0 } (l) | |
in (d) | |
in { | |
"Prompt": "Plug in any two numbers (integers, within reason) to divide them", | |
"Divide":\input1 -> \input2 -> divide input1 input2 10 0.1 | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment