Thanks for the kata, I learned a whole new topic and for the first time I hear about Polish notation. Interesting to know.

Haskell fork including random tests and updating fixed tests to check for approximate equality.

Approved, thanks!

Approved

Prolog translation

JS fork, Chai assertions, random tests, approx equal for float comparison.

Approved

OP solved it, closing

This is just due to a lack of random tests, which is already an open issue

should handle solutions like this.

C#: method name should be PascalCase (Please refer to implementation of backward compatibility here )

Ruby

main.rb:4:in `inspect': stack level too deep (SystemStackError)

Something is wrong with this kata. It throws the same error when solved in 3 different ways (recursion, creating a new array through a loop, converting to a string and back to an array using the eval method). At the same time, I cannot see on which test I have an error, since it does not open a single example except for 2 Sample Tests. Is this kata broken or does it just artificially forbid any solutions other than what the author has in mind?

Lol, it seems even after accounting for the annoyance of that circular structure, my edgy use of an eval string is causing a time fail anyway, rofl

The case is 10000 123 +. The result seems obvious

According to the algortihm 10000123+ should evaluate to 5 right? Am I missing something?