YuMingLiao

Oh! right, IO is the real tricky thing. Brilliant! Now you can have IO/pure expressions with any error and compose them together later in your Action. Thanks for sharing!

A note: after looking into the code, I guess the type deduction and equality-check should happen in binary operations like union.

I would like to offer some thought about type deduction and type check here: I guess it would be like a monoid thing. I mean: relvar1 :: {a a} relvar1...

infix operators and optionally tighter type checking (with attribute names) sounds interesting. Sounds we need a tutd ADT first?

Good idea! ``` let boundedQuery :: Q SqliteSelectSyntax _ _ _ boundedQuery = limit_ 1 $ offset_ 1 $ orderBy_ (asc_ . _userFirstName) $ all_ (_shoppingCartUsers shoppingCartDb) ``` I am,...

hi @matchwood It sounds awosome! I definitely have interest in seeing and learning. Please create a repo for it.

I see your point. I guess I can write `:s true:{a:=id(1)}` to test a function. That's workable. Or does a :showatom `:a id(1)` help newcomers to try atom functions while...

I import a 17 attributes / ~200000 tuples relation. The memory usage jumps from ~2G to ~4G after committing, quitting, and re-entering. And typing in TutorialD becomes slow, which made...

it seems to me that function-derived attributes can be safely referred to in a relational expression. However, if it is allowed in insert and upsert, it implies that the attribute...

On second thought... Tuple function is like atom function. It can be used in relational expression to extend an column. And we want data independence. So maybe we can define...