IT, operating systems, maths, and more.
This is the second part of the TLA+ series. For your convenience you can find other parts in the table of contents in Part 1 — TLA+ to ILP Part 1 — Reducing problem Let’s now carry on with adding more invariants. Tutorial says to reorder the operations, so let’s first update the db and … Continue reading TLA+ Part 2 — TLA+ to ILP Part 2 — Performance check
This is the first part of the TLA+ series. For your convenience you can find other parts using the links below: Part 1 — TLA+ to ILP Part 1 — Reducing problem Part 2 — TLA+ to ILP Part 2 — Performance check Today we are going to reduce some TLA+ algorithm to ILP and … Continue reading TLA+ Part 1 — TLA+ to ILP Part 1 — Reducing problem
Today we’re going to encode state of International Checkers game in as little as possible. There are two players, each of them has at most 20 pieces, some are men, some are kings. The board is 10 by 10 big (so has 100 fields in total). First solution we may have is to encode position … Continue reading Encoding Checkers in three longs
This is the sixth part of the Types and Programming Languages series. For your convenience you can find other parts in the table of contents in Part 1 — Do not return in finally Today couple words about Liskov substitution princple (LSP for short). It is often misunderstood which leads to unclear directions how to … Continue reading Types and Programming Languages Part 6 – Liskov substitution principle
This is the fourth part of the Types and Programming Languages series. For your convenience you can find other parts in the table of contents in Part 1 — Do not return in finally The Diamond Problem, sometimes called Deadly Diamond of Death, is a problem in which we inherit the same thing through multiple … Continue reading Types and Programming Languages Part 4 – Diamond problem