WIP
This commit is contained in:
parent
654012f2ef
commit
929c71488a
@ -43,7 +43,6 @@ Compared to the above projects, Geolog combines several features that no single
|
||||
* **Interactive REPL** — explore and mutate instances dynamically, unlike batch-mode model finders
|
||||
* **Constructive proof witnesses** — the Petri net showcase demonstrates solutions as typed diagrammatic objects, not just boolean answers
|
||||
|
||||
|
||||
## Changelog
|
||||
|
||||
* **Feb 27, 2026** -- The first version was created.
|
||||
|
||||
@ -39,7 +39,6 @@
|
||||
proof. If the types check and all axioms are satisfied, reachability is proven. This is the "propositions as types, proofs as programs" idea from
|
||||
type theory, applied to diagrammatic reasoning.
|
||||
|
||||
|
||||
## Changelog
|
||||
|
||||
* **Feb 27, 2026** -- The first version was created.
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user