Montague VS bedelibry-app

But basically, I'm interested in figuring out how I might re-implement the search algorithm I implemented in this repo in Rust to make it blazingly fast more performant.

Also (shameless plug), but trying to use something like this for Lojban would be cool.

You can check out my latest iteration of the concept here if you're interested. It is currently mostly Haskell, as that is what I am most familiar with, and that is what my library for parsing natural language into structured form (Montague) is written in. But I'm also a fan of Rust -- and you'll see that part of the application is written in Rust due to the use of Tauri for desktop versions.

I've done some experimentation towards this end in both https://github.com/sintrastes/montague and (older, less of a complete implementation) in https://github.com/sintrastes/bli-prolog

You can check out my latest iteration of the concept here if you're interested. It is currently mostly Haskell, as that is what I am most familiar with, and that is what my library for parsing natural language into structured form (Montague) is written in. But I'm also a fan of Rust -- and you'll see that part of the application is written in Rust due to the use of Tauri for desktop versions.

For what it's worth, the app I'm building is currently set up as an obsidian project -- and one of my ideas was to try to set it up as a reflex-platform project instead to make it easier for me to do things like e.x. tweak the nixpkgs and ghc versions and see if that helps at all (I saw an issue on github somewhere that said some of the problems on OSX are related to an old nixpkgs version -- but I'm not entirely sure yet how I might tweak that manually in either an obsidian or reflex-platform project, or if that's even feasible).