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.
1 people like thisPosted: 3 days ago by Eugene Gavrin
A simple expression tree visitor, to inject a lambda inside another lambda parameters.
2 people like thisPosted: 4 days ago by Tuomas Hietanen
This snippet based on Binet's formula combined with fast power algorithm. Four multiplications run in parallel, thus processor with four cores recommended. Bitwise operators improve divisions and multiplications by pow of 2.
0 people like thisPosted: 5 days ago by Pavel Tatarintsev
Get Bitcoin wallet account balance by public 1HT7xU2Ngenf7D4yocz2SAcnNLW7rK8d4E
0 people like thisPosted: 6 days ago by The streets
List and calculate and evaluate the polynomials and the expressions for the the derivatives of the powers of trigonometric and hyperbolic sine and cosine.
1 people like thisPosted: 7 days ago by Stijn “Adhemar” Vandamme
Demonstrates how to compose code at run time using F# quotations (both typed and untyped) and how to compile and run/execute the quotation using F# Quotations Evaluator (based on F# 2.0 PowerPack code) from the F# Software Foundation. (Updated October 25, 2019)
0 people like thisPosted: 18 days ago by Tomas Petricek, Zane Purvis
Strategy pattern in F#
72 people like thisPosted: 8 years ago by Tao Liu
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
86 people like thisPosted: 8 years ago by fholm
Some simple functions for writing more idiomatic F# tests with NUnit.
87 people like thisPosted: 8 years ago by Ryan Riley
An asynchronous sequence is similar to the seq
Posted: 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
The Let active pattern demonstrated by this snippet can be used to assign values to symbols in pattern matching. This is useful for writing complex pattern matching using match as we can handle multiple cases using a single clause.
64 people like thisPosted: 8 years ago by Tomas Petricek
collections (16) array (21) string (22) seq (54) regex (15) web (24) agent (20) algorithms (25) staging (18) math (34) async (95) design patterns (18) reflection (18) lazy (19) wpf (20) fold (20) http (15) silverlight (22) sequences (47) html (15)
Daniel Robinson (7) NIck Palladinos (14) Fabio Galuppo (14) Phillip Trelford (88) mavnn (17) Robert Pickering (11) Tao Liu (17) Zhukoff Dima (8) Faisal Waris (32) Tomas Petricek (144) Antonio Cisternino (8) Carsten König (10) devshorts (11) Taha Hachana (12) Samuel Bosch (12) Joel Huang (14) Nick Palladinos (66) Cesar Mendoza (17) fholm (26) nagat01 (19)
Database contains 2365 snippets out of which 1607 is public.