Until FSI gets package references, we are to reference DLLs individually. This script sets up the FSI session to use ML.Net - assuming the required packages are loaded in the default location for the solution. Normally, referencing the latest AutoML and TimeSeries packages will net all the packages listed here.
1 people like thisPosted: 3 days ago by Faisal Waris
This little snippet shows you how you can create a simple recursive data type and define a pair of functions that maps the set of positive integers to unique instances in the AST and back again.
1 people like thisPosted: 7 days ago by Steve Goguen
Converting F# LINQ queries to SQL: - Basic example of simple group-by - Also if you want to have multiple aggregates (SUM, COUNT, MAX, MIN, AVG, ...) in the same SQL-clause, that is done with groupBy over a constant value.
1 people like thisPosted: 9 days ago by Tuomas Hietanen
As described in https://en.wikipedia.org/wiki/Harshad_number
0 people like thisPosted: 9 days ago by Tuomas Hietanen
Type-safe Nullable
Posted: 12 days ago by Bang Jun-young
For a given matrix of height H and width W, create a new matrix of height W and width H which is the clockwise rotation of the original matrix.
1 people like thisPosted: 16 days ago by groch
Three functions showing how to implement projection for functional lists. First version uses naive recursion and the second one is tail-recursive using the accumulator parameter. The third version extends this with continuation passing.
65 people like thisPosted: 8 years ago by Tomas Petricek
Three ways to split a list in half (but not necessarily in the middle). A forth version added that's very short and should be fast, as we only use List.fold. New champ found.
78 people like thisPosted: 8 years ago by Dmitri Pavlenkov
Implements iterate function from Haskell's Prelude. The function generates an infinite sequence by applying a function to the initial value (first) and then to the result of previous application.
203 people like thisPosted: 8 years ago by Nick Palladinos
Three functions showing how to implement projection for functional lists. First version uses naive recursion and the second one is tail-recursive using the accumulator parameter. The third version extends this with continuation passing.
65 people like thisPosted: 8 years ago by Tomas Petricek
Classical "Hello world" example that prints a message to the console output. This version uses F# printfn function to do the printing.
179 people like thisPosted: 8 years ago by Tomas Petricek
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: 8 years ago by Neil Carrier
fparsec (15) reflection (18) sequences (47) web (24) generic programming (15) f# (42) lazy (19) staging (18) parsing (25) pattern matching (13) async (95) list (51) game (30) collections (16) monad (22) silverlight (22) kata (17) mailboxprocessor (27) recursion (30) array (21)
Carsten König (10) Nick Palladinos (66) mavnn (17) Kit Eason (51) Robert Pickering (11) Zhukoff Dima (8) Cesar Mendoza (17) Tomas Petricek (145) Eirik Tsarpalis (84) Ankur Dhama (20) Daniel Robinson (7) Rick Minerich (15) Joel Huang (14) Dmitry Soshnikov (7) nagat01 (19) fholm (26) NIck Palladinos (14) Mauricio Scheffer (7) Phillip Trelford (88) Faisal Waris (31)
Database contains 2353 snippets out of which 1598 is public.