Blog articles

0
comment
on 11/17/2011 4:04 PM
Gordon has a blog post on F# agents with timeouts In my previous post , I showed a code snippet with a very simple F# agent console application. You run the app from the console, and every time you enter a line of text, it generates a new message and post[...]
.
0
comment
on 11/17/2011 4:00 PM
Over on the F# team blog we've announced Updates to the August 2011 F# 2.0 Compiler Code Drop   As announced at the Microsoft Research 20th Anniversary event in Cambridge UK, we have updated the F# 2.0 compiler source code drop to include changes related [...]
.
0
comment
on 11/17/2011 3:15 AM
Regular readers of my blog will know that from time to time I post pointers to technologies that work with F#, as a service to the F# community. I've blogged in the past about other maths and stats libraries that work with F#, and am adding another one to[...]
.
0
comment
on 11/15/2011 11:37 PM
Tonight my colleague Byron Cook from MSR Cambridge will be speaking at the F#unctional Londoners meetup group Byron Cook: Proving program termination with F# Wednesday, November 16, 2011, 6:30 PM The Skills Matter eXchange 116-120 Goswell Road,  L[...]
.
0
comment
on 11/15/2011 5:13 PM
.
0
comment
on 11/15/2011 10:00 AM
.
0
comment
on 11/15/2011 4:29 AM
As announced at the Microsoft Research 20th Anniversary event in Cambridge UK, we have updated the F# 2.0 compiler source code drop to include changes related to the www.tryfsharp.org web application. The code drop is the compiler\2.0\Aug2011.1 directory [...]
.
0
comment
on 11/14/2011 1:24 PM
If you google for methods of detecting the cpu architecture, you’ll find lots of pages about how to use WMI and ManagementObjectSearcher. This is an immensely slow operation which takes more than a second to complete (at least when I’ve timed it on a 2.8 [...]
.
0
comment
on 11/13/2011 4:19 AM
Problem The square root of 2 can be written as an infinite continued fraction. The infinite continued fraction can be written, ?2 = [1;(2)], (2) indicates that 2 repeats ad infinitum. In a similar way, ?23 = [4;(1,3,1,8)]. It turns out that the sequence o[...]
.
0
comment
on 11/12/2011 6:47 PM
Problem Consider the fraction, n/d, where n and d are positive integers. If n < d and HCF(n,d)=1, it is called a reduced proper fraction. If we list the set of reduced proper fractions for d <= 8 in ascending order of size, we get: 1/8, 1/7, 1/6, 1/5, 1/4[...]
.
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