All algebraic data types are enumerable, so I want to assign a natural number to any algebraic data type. And then I want to assign a natural number to every instance of that type.
So I need bijection.
All algebraic data types are enumerable, so I want to assign a natural number to any algebraic data type. And then I want to assign a natural number to every instance of that type.
So I need bijection.
I want to start series of posts about design and implementation curve editor, like this one from Gimp software:
With Typescript and React. Let's start!
Concept of discrete world
System concept
Laws language
This is spectral locus and sRGB gamut
This is demonstration of simple image processing on canvas:
This is React component embedded into markdown file:
The code
$$ \frac{n!}{k!(n-k)!} = \binom{n}{k} $$
is rendered as the formula
Always forget order in command arguments.
Syntax is: ln -s [file] [link location]
I want to enumerate given finite class of abstract objects.
Tesseract is open-source OCR engine.
Want to refresh my knowledge about Prolog. I am curious about is it possible to use Prolog for context-free string parsing? This task could help me to understand differences between Prolog and SMT solvers. I already implemented parser with Z3, I want to do the same with Prolog.