Verity :transHaskell::verifiedtransfem:
monoidmusician@tech.lgbt
<p>essence of verity, not from concentrate. maths, programmings, arts. type theory and calligraphy.</p><p>huggy & huggable. multiplexed, monoidal. disabled. type checked and verified.</p><p>:verifiedtransfem: :neocat_flag_disabled: :neurodiv: :neocat_flag_lesbian: :drgn_flag_demiace:</p><p>against LLMs, NFTs, blockchain, AI Art, etc.</p>
Posts
-
Post #3178134
thinking again about how natural transformations can really be thought of as natTrans :: (forall x y. (x -&gt; y) -&gt; f x -&gt; g y) subject to a simple coherence condition: fmap f . natTrans g . fmap h = natTrans (f . g . h) or alternatively that fmap f . natTrans id = natTrans f = natTrans id . fmap f basically meaning that the mapping (x -&gt; y) is not sequenced with the natural transformation f ~&gt; g in either direction, but integral to it and it's just the t...
-
Post #3178133
is anyone aware of research on generating LR or LL parse tables that exploits sharing in the grammar? like, the conventional approach is to expand the grammar so that it is a sum of products: each nonterminal has multiple flat rules that it can match, with no choice in those rules (the most classic of BNFs, if you will) but grammars may be constructed in a tree shape, especially with applicative combinators, where sequencing and choice are interleaved: (p &lt;|&gt; q) &lt;*&g...
-
Post #1708583
How few &lt;path&gt;s do you need to create a full railway in SVG? (and &lt;mask&gt;, &lt;use&gt;, and &lt;group&gt;s). I've been working on this process for drawing railways in SVG, just based on cloning paths with various strokes. Not computing anything, just letting the SVG renderer handle rasterizing the stroke widths and compositing it all together. It works pretty well, but the exclusion mask to handle junctions renders slowly, and obviously it cannot...
-
Post #1494382
went through my old PDFs, a lot of which were about FRP and mostly unread. so now I'm reading about Lucid Synchrone, a ML-like language for synchronous programming on streams, with type inference and clock inference (although it could almost use dependent types for its clocks haha)
-
Post #1494381
remember to maintain adequate ecosystem diversity in your last used signal stickers!
-
Post #1494380
wonder how feasible it would be to do a whole-program kind of taint analysis to see which values of known types could possibly come from FFI still thinking about my idea of compiling PureScript directly to some intermediate representation of JavaScript JIT, making direct/unsafe use of typing information where safe
-
Post #1354351
https://blog.veritates.love/accuracy.html One of the things I believe about art is that accuracy is rarely wasted. A couple days ago I made a piece of art that I found really satisfying, but it isn't quite accurate yet. I improved a lot of details: I eliminated flat colors that caught the eye, removed visible seams, added more textures and shapes to give depth to the scene, and rerendered it dozens of times to see how it was progressing. But I haven't gotten back to fixing the small t...