F# Bloggers

Blog articles of F# Bloggers

0
comment
on 1/24/2015 8:06 AM
Je kunt F# op verschillende manieren gebruiken, waaronder het “Exploratief Programmeren”. Wie wel eens een SQL query heeft geschreven in een Database tool, heeft al eens aan “exploratief programmeren” gedaan. Eerst maak je een query, daarna run je deze, vervolgens controleer je de resultaten, en daarna blijf je sleutelen totdat de query teruggeeft wat je wilt. Dat snelle actie-correctie programmeren is dus exploratief programmeren, en dat kan ook in F#, via de F# Interactive. In Visual [...]
>> Read the full article
.
0
comment
on 1/22/2015 2:28 PM
Following up from @isaac_abraham’s awesome F# Enigma machine emulator, I decided it would be 10x cooler if it was in a type provider, because let’s face it, everything is 10x cooler once it’s in a type provider. Here a some pictures of it in action! As you can see, it uses an extensive property system that presents a menu along with the various controls to setup your enigma machine, and then finally to translate some text.  This TP is written with my InteractiveProvider as per usual.  On my first attempt[...]
>> Read the full article
.
0
comment
on 1/17/2015 7:17 AM
Somewhere in 2011 I started a game with the working title “Three is a Crowd” (TIC for short). The game is a version of Reversi, but now for three players. The main goal of creating this game was: learning and using new technologies, keeping my tech-knowledge up-to-date. In that respect, it reflects my personal interests. TIC was originally written in C#. At some moment I was interested in a better way to write the AI, and that started me on learning F#. Quickly I came to the conclusion, th [...]
>> Read the full article
.
0
comment
on 1/16/2015 5:51 AM
[All code from this post available as a GitHub gist here] For Christmas this year, I got myself a fun mathematical gift: a set of 10 non-transitive dice, namely Grime Dice! You can get your own set here. Behold their dicey splendor: These dice possess the fascinating property that their winning relationships (in the sense of "winning" = "rolls … Continue reading Non-transitive Grime Dice, via Mathematica →
>> Read the full article
.
0
comment
on 1/15/2015 4:00 PM
For Christmas this year, I got myself a fun mathematical gift: a set of 10 non-transitive dice, namely Grime Dice! You can get your own set here. Behold their dicey splendor: These dice possess the fascinating property that their winning relationships (in the sense of “winning” = “rolls a higher number > 50% of the time”) are non-transitive. i.e. if die A wins against die B, and die B wins against die C, it actually does *not* hold, in general, that die A wins against die C.  In fact, die C might win [...]
>> Read the full article
.
IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us | Terms of Use | Privacy Policy | Cookie Policy
Built with WebSharper