So I wrote an implementation of linear search in Mu using its array type.<p><a href="https:&#x2F;&#x2F;gist.github.com&#x2F;uucidl&#x2F;df81b6ab0fe65713f5ba" rel="nofollow">https:&#x2F;&#x2F;gist.github.com&#x2F;uucidl&#x2F;df81b6ab0fe65713f5ba</a><p>My notes:<p>- creating an array w&#x2F; create-array is possible, however I could not find how to take its address and pass it around<p>- one cannot get the address of an invalid position of the array, so one cannot construct bounded ranges (STL style) using a begin&#x2F;end pair of addresses<p>- the interpreter strongly suggests to use refcounted pointers (address:shared) instead of addresses even when one does not borrow the memory<p>- could not figure out how to write a test scenario that uses checks named memory addresses rather than ordinal memory addresses (memory-should-contain instruction)