Download and install Ollama: https://ollama.com/ Ollama is a free common host for multiple different LLM-models like Google Gemma, OpenApi's GPT-OSS, Deepseek, etc.
0 people like thisPosted: 1 month ago by Tuomas Hietanen
ModelContextProtocol with FSharp (MCP with F#) https://modelcontextprotocol.io/docs/getting-started/intro Client and Server examples using https://github.com/modelcontextprotocol/csharp-sdk
0 people like thisPosted: 1 month ago by Tuomas Hietanen
Takes a list of (quantity/amount and price/rate) as decimals, and gives a weighted average
0 people like thisPosted: 2 months ago by Tuomas Hietanen
Example of shaping an anonymous-object-as-JSON structure for an Azure dashboard using strong typing and minimal code using Farmer F# https://compositionalit.github.io/farmer/
0 people like thisPosted: 2 months ago by Tuomas Hietanen
A functional wrapper around MailboxProcessor that simplifies agent-based concurrency, adds error handling via events, and provides convenience functions to avoid common pitfalls when working with asynchronous message processing in F#.
2 people like thisPosted: 3 months ago by halcwb
Timestamp: Time format in ISO 8601 with timezone. YYYYMMDDhhmmssffff+zzzz For example 2011-05-17 19:01:10.000 -0200 would be: 20110517190110000-0200
0 people like thisPosted: 5 months ago by Tuomas Hietanen
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.
100 people like thisPosted: 14 years ago by Neil Carrier
Strategy pattern in F#
83 people like thisPosted: 14 years ago by Tao Liu
While prototyping programs I find myself using association lists. This little snippet defines a lookup functions for association lists defined as lists of tuples.
68 people like thisPosted: 14 years ago by Alex Muscar
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.
74 people like thisPosted: 14 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.
100 people like thisPosted: 14 years ago by Neil Carrier
version 1 is http://fssnip.net/62. This new version support convert from any existing function to a converter function by using composition and pipeline. The convert function is to make the function signature agree to the IValueConverter interface. You can add new functions in the FunctionLibrary module and reuse the class definition to reduce the coding effort. The first sample is to show how to make the converter pipeline work, the second one is a debugger converter used to debug the data binding problem.
90 people like thisPosted: 14 years ago by Tao Liu
recursion (33) list (56) mailboxprocessor (27) tryfsharp (48) algorithms (26) json (16) pattern matching (15) lists (15) monad (24) regex (17) seq (54) dsl (23) web (29) f# (43) fold (22) silverlight (22) sequence (32) game (32) design patterns (18) async (98)
Eirik Tsarpalis (89) Samuel Bosch (12) Faisal Waris (37) Ankur Dhama (20) Carsten König (10) Kit Eason (51) mavnn (17) NIck Palladinos (14) Tuomas Hietanen (80) Vesa Karvonen (8) devshorts (11) Antonio Cisternino (8) nagat01 (19) Phillip Trelford (87) Tao Liu (17) Evgeniy Andreev (13) Cesar Mendoza (17) Ryan Riley (25) Gauthier Segay (11) Nick Palladinos (66)
Database contains 3206 snippets out of which 1719 is public.