https://blog.smarttechventures.au/tags/fsharp/Recent content in Fsharp on Chris McKelt - Remembering ThoughtsHugo -- 0.147.2enMon, 28 Mar 2016 00:00:00 +0800https://blog.smarttechventures.au/articles/posts/linqpad-and-f-scripts/Mon, 28 Mar 2016 00:00:00 +0800https://blog.smarttechventures.au/articles/posts/linqpad-and-f-scripts/<h1 id="import-these-references">Import these references</h1> <p><img alt="image" loading="lazy" src="https://user-images.githubusercontent.com/662868/120944745-b741c880-c768-11eb-9182-d53d9f451a72.png"></p> <h3 id="sample-script">Sample script</h3> <script src="https://gist.github.com/chrismckelt/7f2ec81a893e5f31d056.js"></script> <h3 id="graph">Graph</h3> <p>  <img alt="image" loading="lazy" src="https://user-images.githubusercontent.com/662868/120944762-c9bc0200-c768-11eb-8d84-3df4d099fe09.png"></p>https://blog.smarttechventures.au/articles/posts/f-beginnings/Mon, 07 Mar 2011 00:00:00 +0800https://blog.smarttechventures.au/articles/posts/f-beginnings/<blockquote> <p>open System</p> <p>#light // Hello world let a = &ldquo;Hello, world!&rdquo;;</p> <p>let mutable b = 0;<br> while b &lt; 10 do b &lt;- b+1<br> Console.WriteLine(a + b.ToString())</p> <p>Console.ReadLine() |&gt; ignore</p> <p>// recursive binary search - <a href="http://rosettacode.org/wiki/Binary" target="_blank">http://rosettacode.org/wiki/Binary</a>_search#F.23<br> let items = [| 10; 20; 30; 40; 50; 60; 70; 80; 90; 100; |]</p> <p>let rec binarySearch (arr:int[], low:int, high:int, value:int) = if (high &lt; low) then<br> false<br> else<br> let mid = (low + high) / 2</p>https://blog.smarttechventures.au/articles/posts/f-keywords/Thu, 03 Mar 2011 00:00:00 +0800https://blog.smarttechventures.au/articles/posts/f-keywords/<script src="https://gist.github.com/chrismckelt/a6dc122913bdd40616a5.js"></script>