Recently added snippets
This is just the ML code from http://jozefg.bitbucket.org/posts/2015-02-28-type-inference.html ported to F#.
Posted: 19 hours ago by Rick Minerich
Normalisation of "F# quotations" by evaluation.
Posted: yesterday by Nick Palladinos
Formatting a Timespan to something fully descriptive and user friendly.
Posted: 4 days ago by Gauthier Segay
Overrides the standard Web API ApiControllerActionInvoker with one that works with controller actions return F# Async<'T> results.
Posted: 4 days ago by Ryan Riley
Counting 1-bits in a DWORD (int32) using the 'divide and conquer' strategy
Posted: 5 days ago by Fabio Galuppo
Turn a project based nuspec into a project type paket template (see http://fsprojects.github.io/Paket/template-files.html )
Posted: 8 days ago by mavnn
I use this basic template when writing .fsx files that I might want to compile. It adjusts the difference in command line/entrypoint handling between a script and a compiled assembly. This example shows the details for a WPF script — replace the #r's and/or remove the STAThread for a WinForms or Console script.
95 people like this
Posted: 4 years ago by Blake Coverett
F# implementation of a generic Top-Down-Operator-Precedence Parser as described in this paper http://portal.acm.org/citation.cfm?id=512931 Example starts at line ~300
80 people like this
Posted: 4 years ago by fholm
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.
182 people like this
Posted: 4 years ago by Nick Palladinos
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.
94 people like this
Posted: 4 years ago by Antonio Cisternino
Classical "Hello world" example that prints a message to the console output. This version uses F# printfn function to do the printing.
162 people like this
Posted: 4 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.
81 people like this
Posted: 4 years ago by Neil Carrier
Snippets by tagsView all..
Snippets by authorsView all..
Database contains 1577 snippets out of which 1169 are public.