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

- There is finite discrete world
- World consists from objects
- Every object is atomic or contains other objects
- Every object is unique, that means:
- No one part of object is shared with some other object
- No object or its part contains itself (also in transitive manner)
- World exists finite amount of time
- Time consists from discrete clock ticks
- Something could happen only at some clock tick
- 'Something' is world state change: one object or one from its parts are created or removed

System concept

- System consists from two parts: world and computer
- Computer have fixed collection of laws describing possible state transitions
- Laws are permitting only one transition per tick
- World state change is happening only when laws are not violated.

Laws language

- Rules that describe initial world state
- Rules that describe state transitions
- Every object have a reason to exist: by rule application or as a part of an initial state

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

$\frac{n!}{k!(n-k)!} = \binom{n}{k}$

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.