/explore
|
You are here 
|
blog.sigplan.org | ||
| | | | |
johnazariah.github.io
F# and Q# are more tightly related than you might expect. Here's the story of how F# influenced and enabled the development of Q# - Microsoft's language for Quantum Computing |
|
| | | | | ||
| | | | |
www.wingolog.org
wingolog: article: static single assignment for functional programmers |
|
| | | | | ||
| | | | |
johnwickerson.wordpress.com
T-diagrams (or tombstone diagrams) are widely used by teachers to explain how compilers and interpreters can be composed together to build and execute software. In this blog post, Paul Brunet and I revisit these diagrams, and show how they can be redesigned for better readability. We demonstrate how they can be applied to explain compiler... |
|
| | | | | ||
| | | | |
jobjo.github.io
Parser combinators aresets of functions for building parsers in a composable fashion. Haskell'sParsec library and OCaml'sAngstrom are two examples.Both of th... |
|
| | | |||
