|
Top-level
 @neauoire yaaaayyyy this is a lo-fi flavour of the Result<T> concept :) it's analogous to an Option<T> for methods (words) that might return null. I (very subjectively) find having to handle things in a balanced way like this leads to more understandable code. https://blog.logrocket.com/understanding-rust-option-results-enums/ 8 comments
@neauoire your assessment is correct. I never found much useful. I was planning my way around doing things very DIY and kinda blue collar since there's almost no academic research or past art to refer to, especially for my plans with Gale (inference, etc)  @klardotsh everything that I could find, I've collected here: http://wiki.xxiivv.com/site/type_systems.html I'll improve as I go along.  @neauoire @klardotsh looks like you are in the Maybe monad... and maybe bind is the concatenation you are looking for... @chainik @klardotsh monad? in point-free assembly? I'm having trouble understanding what that might look like. Do you have a link on monads in Joy or Factor? @neauoire @chainik @klardotsh I can imagine a Maybe monad in joy looking something like wordThatReturnsMaybe [doSomethingToResult] map or wordThatReturnsMaybe @neauoire @klardotsh i don't have a concrete suggestion because my head isn't in the details. abstractly, i recognise Maybe and if the rest of the computation was happening in the monad it would type check :) |
Gregory's Server
@klardotsh did you ever come across anything about type-checking in regards to concatenative languages by any chance? The body of work on the topic, that I can find, is extremely thin.