-
https://en.wikipedia.org/wiki/Kleene_algebra
This is always fun. We could have a method to get the BoundedSemilattice from the `+` operation.
I guess this extends `Rig`. So something like:
``` scal…
-
First, make a lexer directly using fastparse.
For fun, define a Kleene-* algebra trait, make a regex data type (with constructors for alternation, concatenation, and star), make a language data type …
-
# Problem
The postfix operators `*` and `+` (the Kleene closures) don't work yet in Ampersand, even though the need for them occurs frequently when specifying information systems in Ampersand. We hav…
-
An outline :
1. Define the lifting monad $\mathcal{L}$
2. Define the syntax primitive recursive functions
3. Define $\mu$
4. Interpret the syntax of partial recursive functions using the $\mathca…
-
Hi, I was looking at kleene algebras recently. They naturally include a transitive closure operator. While it is possible to interpret the graph algebra under transitive closure semantics, is there a …
-
```
-- https://pdfs.semanticscholar.org/6f33/978012f794cc5fff60506db730e6a15185e7.pdf -- Introduction to Kleene Algebra Lecture 7, Equational Theory of Kleene Algebra
-- https://pdfs.semanticschola…
-
## Background
The previously proposed work discussed building techniques for getting a CFG representation of our data flow to be able to apply static analysis on these and prevent data races:
-…
-
Key: SP = small project, SC = small chore.
This is a list of a bunch of todos in a semi-disorganised way; I've been going through literally every occurence of the string "todo". These were chosen t…
-
Roughly these rules which depend on a proof `ax≡xb`
```
bisimulation : ∀ {a b x : A} → a ∙ x ≡ x ∙ b
→ a * ∙ x ≡ x ∙ b *
bisimulation {a} {b} {x} ax≡xb = {! !}
…
-
### Is your feature request related to a problem or challenge?
Follow on https://github.com/apache/arrow-datafusion/issues/6559.
## Argument quality:
- definite (`def`) and undefined (`undef`);…