Small script to generate a X509 certificate for testing purposes. In my case, for generating signed PDF documents. This will write the certificate and it's key out into a Pkcs 12 store. It relies on the BouncyCastle library (version 1.7 worked fine).
3 people like thisPosted: 2 months ago by mavnn
令人愉快的 旅游信息网站, 继续发展 充满灵感。感谢!
4 people like thisPosted: 8 months ago by 方尖碑
Pong video game runnable inside fable.io. Controls are "A" for left, and "D" for right.
10 people like thisPosted: 10 months ago by Phillip Trelford
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.
2 people like thisPosted: 1 year 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
2 people like thisPosted: 1 year ago by Tuomas Hietanen
Takes a list of (quantity/amount and price/rate) as decimals, and gives a weighted average
1 people like thisPosted: 1 year ago by Tuomas Hietanen
Two functions showing how to filter functional lists using the specified predicate. First version uses naive recursion and the second one is tail-recursive using the accumulator parameter.
77 people like thisPosted: 15 years ago by Tomas Petricek
get the list of ethernet sql servers
90 people like thisPosted: 15 years ago by nCdy
We start with an initial value and then applying f repeatedly, until the value does not change anymore.
303 people like thisPosted: 15 years ago by Nick Palladinos
Composition of functions in F# is easily achieved by using the >> operator. You can also chain an arbitary amount of functions (represented as a list or sequence) together by folding the list/seq with >>. [More formally: the set of endomorphisms 'a -> 'a forms a monoid with the binary, associative operator ">>" (or "<<") and the neutral element "id".]
87 people like thisPosted: 15 years ago by Novox
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: 15 years ago by Neil Carrier
This is to demonstrate that: (1) there are many ways to solve the same problems; (2) operators can be grouped together into data structures and act as data; (3) you can have fun in F# in many ways.
57 people like thisPosted: 15 years ago by Dmitry Soshnikov
Brian Berns (9) Eirik Tsarpalis (89) Faisal Waris (37) Vesa Karvonen (8) Tuomas Hietanen (80) Fabio Galuppo (14) Joel Huang (13) Kit Eason (51) Tomas Petricek (150) fholm (26) Rick Minerich (15) Cesar Mendoza (17) Robert Pickering (10) Taha Hachana (12) Ryan Riley (25) Tao Liu (17) Carsten König (10) Gauthier Segay (11) nagat01 (19) Zhukoff Dima (8)
Database contains 3209 snippets out of which 1719 is public.