- title : FsReveal
- description : Introduction to FsReveal
- author : Karlkim Suwanmongkol
- theme : night
- transition : default
- Generates reveal.js presentation from markdown
- Utilizes FSharp.Formatting for markdown parsing
- A framework for easily creating beautiful presentations using HTML.
Atwood's Law: any application that can be written in JavaScript, will eventually be written in JavaScript.
- F# tools for generating documentation (Markdown processor and F# code formatter).
- It parses markdown and F# script file and generates HTML or PDF.
- Code syntax highlighting support.
- It also evaluates your F# code and produce tooltips.
let a = 5
let factorial x = [1..x] |> List.reduce (*)
let c = factorial a
[lang=cs]
using System;
class Program
{
static void Main()
{
Console.WriteLine("Hello, world!");
}
}
[lang=js]
function copyWithEvaluation(iElem, elem) {
return function (obj) {
var newObj = {};
for (var p in obj) {
var v = obj[p];
if (typeof v === "function") {
v = v(iElem, elem);
}
newObj[p] = v;
}
if (!newObj.exactTiming) {
newObj.delay += exports._libraryDelay;
}
return newObj;
};
}
[lang=haskell]
recur_count k = 1 : 1 : zipWith recurAdd (recur_count k) (tail (recur_count k))
where recurAdd x y = k * x + y
main = do
argv <- getArgs
inputFile <- openFile (head argv) ReadMode
line <- hGetLine inputFile
let [n,k] = map read (words line)
printf "%d\n" ((recur_count k) !! (n-1))
code from NashFP/rosalind
[lang=sql]
select *
from
(select 1 as Id union all select 2 union all select 3) as X
where Id in (@Ids1, @Ids2, @Ids3)
sql from Dapper
Bayes' Rule in LaTeX
$ \Pr(A|B)=\frac{\Pr(B|A)\Pr(A)}{\Pr(B|A)\Pr(A)+\Pr(B|\neg A)\Pr(\neg A)} $
When I show my boss that I've fixed a bug:
When your regular expression returns what you expect:
from The Reality of a Developer's Life - in GIFs, Of Course
- data-background : images/fsharp128.png
- data-background-repeat : repeat
- data-background-size : 100px
- Press
s
to see a speaker note
' this is a speaker note ' and here we have another one