This snippet uses the lazy keyword to create a delayed computation. It then show's using 'force' to evaluate the computation.
27 people like thisPosted: 14 years ago by Robert Pickering
Show's using the unfold function to create a sequence that terminates once some limit is passed.
39 people like thisPosted: 14 years ago by Robert Pickering
Lazy string based on seq
Posted: 13 years ago by Ankur Dhama
F# Future using lazy and a threading event. Supports creating futures from functions or asyncs. Eager evaluation of can be specified.
4 people like thisPosted: 13 years ago by Ankur Dhama
An iteratee based on https://john-millikin.com/software/enumerator/ and http://okmij.org/ftp/Haskell/Iteratee/IterateeIO-talk-notes.pdf
8 people like thisPosted: 13 years ago by Ryan Riley
When we need lazy evaluation, we use the Lazy<'T>. However, the Lazy<'T> must evaluate explicitly. This example enables implicit evaluation(call-by-need).
6 people like thisPosted: 13 years ago by Nobuhisa
A Simple Implementation of Lazy Type.
3 people like thisPosted: 12 years ago by Joel Huang
Allows to expose an F# async value in a C#-friendly API with the semantics of Lazy<> (compute on demand and guarantee only one computation)
3 people like thisPosted: 11 years ago by Gustavo Guerra
Yet Another Fizz Buzz (YAFB)
8 people like thisPosted: 9 years ago by @Functional_S
An infinite lazy list of primes. Not efficient, but elegant and fun.
4 people like thisPosted: 3 years ago by Brian Berns
Demonstrates using the 'lazy' keyword. Show's how a lazy value will only ever be evaluated once.
45 people like thisPosted: 14 years ago by Robert Pickering
x = f(x) encoded in F#
22 people like thisPosted: 13 years ago by Nick Palladinos
The repmin problem is to replace all elements of a tree of numbers by the minimum element, making only a single pass over the original tree. Repmin is a very ingenious example of Circular Programming.
3 people like thisPosted: 13 years ago by Nick Palladinos
I made LazyBuilder. The synthesis of the lazy function is troublesome. When the call of the Force() method increases, it is ugly. This solves the problem.
11 people like thisPosted: 13 years ago by zecl
An iteratee that uses continuation-passing style as an optimization. There is no more discriminated union, and the signature should feel familiar to those using Async.StartWithContinuations.
5 people like thisPosted: 13 years ago by Ryan Riley
A Lazy Xml structure for processing large xml documents.
11 people like thisPosted: 12 years ago by Nick Palladinos
translation of http://www.cs.cmu.edu/~rwh/introsml/techniques/memoization.htm , no particular reason, just satisfying a tangent, read the cmu site for comments & insights.
2 people like thisPosted: 11 years ago by David Klein
Different ways to write lazy values - using the lazy keyword or the Lazy.Create function. Pick the one you like the most!
2 people like thisPosted: 10 years ago by Tomas Petricek
It is well known that it is impossible to define equality between arbitrary functions. However, there is a large class of functions for which we can determine equality, and it’s strange and surprising. We explore this idea using F# code translated from the Swift programming language.
3 people like thisPosted: 6 years ago by Brian Berns
Demonstrates how to use unfold to create a sequence of fibonacci numbers
5 people like thisPosted: 1 year ago by Dave Yost