This example uses the same data and methods as http://accord-framework.net/docs/html/T_Accord_Statistics_Models_Regression_LogisticRegression.htm
1 people like thisPosted: yesterday by Tuomas Hietanen
F# adaptation of a solution to the expression problem using object algebras, c.f. https://www.cs.utexas.edu/~wcook/Drafts/2012/ecoop2012.pdf
1 people like thisPosted: 3 days ago by Eirik Tsarpalis
The extra type variables can be packed to obj/unpacked from obj so that the type of Optic would have just the 's, 'a, 'b and 't type variables, but I leave that and other further developments out from this example.
2 people like thisPosted: 7 days ago by Vesa Karvonen
Recursive definition of the fibonacci sequence
1 people like thisPosted: 8 days ago by Zaid
This function enables the repeated insertion of a specified value into a sequence. It ensures that Seq.skip will never throw an exception by always ensuring it never skips more elements than remain in the sequence.
0 people like thisPosted: 26 days ago by Hugh Gleaves
TypeShape-driven structural projection and isomorphism generation
0 people like thisPosted: 28 days ago by Eirik Tsarpalis
This snippet is code that solves first Project Euler problem. It finds the sum of all the multiples of 3 or 5 below 1000. Please add other (more efficient, succinct or interesting) solutions to this snippet.
71 people like thisPosted: 6 years ago by Eugene Gavrin
Some simple functions for writing more idiomatic F# tests with NUnit.
85 people like thisPosted: 6 years ago by Ryan Riley
Strategy pattern in F#
68 people like thisPosted: 5 years ago by Tao Liu
This snippet shows how to create objects with events in F#. It shows both simple event (to be used from F#) and a .NET compatible event with specific delegate type.
75 people like thisPosted: 6 years ago by Tomas Petricek
This example shows how to load a Xaml file allowing to use WPF from F#. It also shows how to access WPF objects and register event handlers.
103 people like thisPosted: 6 years ago by Antonio Cisternino
Continuations provide a means whereby heap space can be traded for stack depth (heap space being generally more plentiful than stack depth). They are especially useful where tail recursion is not possible. Here are a couple of simple continuation examples that can be extended to cover more complex scenarios.
88 people like thisPosted: 6 years ago by Neil Carrier
learning f# (16) fold (19) lists (13) wpf (17) html (14) game (30) sequence (29) design patterns (18) tutorial (16) agent (20) dsl (22) string (17) collections (16) monad (20) mailboxprocessor (25) json (12) parsing (22) pattern matching (12) xml (12) seq (48)
David Grenier (7) Taha Hachana (12) Gauthier Segay (10) Ryan Riley (23) Faisal Waris (21) Carsten König (10) Tim Robinson (7) Fabio Galuppo (14) mavnn (17) Mauricio Scheffer (7) Johann Deneux (7) Joel Huang (14) Cesar Mendoza (17) David Klein (16) Eirik Tsarpalis (64) Nick Palladinos (63) Tomas Petricek (143) Ankur Dhama (20) Tuomas Hietanen (58) Robert Pickering (11)
Database contains 2074 snippets out of which 1445 is public.