F#

Programming challenge - have fun #2

By Vlastimil Adamovsky

If you are tired of  “monkey coding”, try to solve some interesting problems.
Requirement: There is an array of integers  from 1 to n.    1 and only 1 number is missing. It means an array of numbers from 1 to n has size of  n - 1 because one number is missing for sure.
Please, send… »

Programming challenge - have fun #1

By Vlastimil Adamovsky
btree

If you are tired of  “monkey coding”, try to solve some interesting problems.
Requirement: There is a Binary search tree , write a program, which will calculate distance from one node to another. For example, on the picture below, the distance from 25 to 76 is 5.
I have come up with a code, please, try… »

Expert F# Listing 9-10

By Vlastimil Adamovsky

As I was learning F# from an excellent book “Expert F#”, I could not make the example (listing 9-10) work with the latest version of F#, which currently is 1.9.6.16
I made some changes in the code (which was an excellent opportunity to get more intimate with the current version F#) and my corrections are here:
added:   … »

DoesNotUnderstand

By Vlastimil Adamovsky

One of the “obstacles” making it difficult to port Smalltalk code to .NET world is the fact that C# (one the most popular .NET languages) does not support  ”doesNotUnderstand” method…. I don’t understand why, though…
After reading a very good article on F# nomads, it hit me, that it is actually pretty simple to implement this… »

It is funny….

By Vlastimil Adamovsky

When I started writing parser for ANTLR, I discovered, that it somehow looks like F#….
So I got interested in F#, where I discovered, I would be able to write a parser and a lexer in it.
I am sure, when I will have written parser and lexer in F# to parse IronGlue grammar, I will realize,… »