Re:Value-Oriented Programming
by mncharity on Wednesday February 08, 2023 @05:23PM
(#34716323)
> focus [...] more on 'implementation' languages
Yes! I've been playing with this recently. For context, long term, I'd like a pushout lattice of theories (types, operators, laws) to get math-like locality. But for a more near-term puzzle, what might highly expressive metaprogramming and collaborative compilation look like?
There are lots of papers on say "tweak some language to add a bit more control over memory layout"... but what if you want subsume all such, concisely. To permit much more gracefully moving around implementation design space. So you can flexibly and concisely express and mixin domain "asks" - this range of values, that variant of `mod`, this handling of alu flags, "try it exact, now bounded exact, now floatNN", with what radix and offsets and scaling, with what intermediates, with what bits landing where manged by whom, etc, etc. With sort of Maude-like[1] "in this scope I want imported these operators and rewrite semantics", but more composably over a higher-dimensional design space.
Apropos a sibling comment, I'm currently at compile/collaboration-time "hashmap all the things", tied in with scoping. Eg, it's not just a literal "5" ast node, it's a rich set of expressed and inferred constraints and preferences on implementation. (If anyone knows of a rich hashmap/assoc/dict combinator library, I'd appreciate hearing of it.)
Yes! I've been playing with this recently. For context, long term, I'd like a pushout lattice of theories (types, operators, laws) to get math-like locality. But for a more near-term puzzle, what might highly expressive metaprogramming and collaborative compilation look like?
There are lots of papers on say "tweak some language to add a bit more control over memory layout"... but what if you want subsume all such, concisely. To permit much more gracefully moving around implementation design space. So you can flexibly and concisely express and mixin domain "asks" - this range of values, that variant of `mod`, this handling of alu flags, "try it exact, now bounded exact, now floatNN", with what radix and offsets and scaling, with what intermediates, with what bits landing where manged by whom, etc, etc. With sort of Maude-like[1] "in this scope I want imported these operators and rewrite semantics", but more composably over a higher-dimensional design space.
Apropos a sibling comment, I'm currently at compile/collaboration-time "hashmap all the things", tied in with scoping. Eg, it's not just a literal "5" ast node, it's a rich set of expressed and inferred constraints and preferences on implementation. (If anyone knows of a rich hashmap/assoc/dict combinator library, I'd appreciate hearing of it.)
[1] err, semi-randomly: https://maude.lcc.uma.es/maude321-manual-html/maude-manualch...