You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello there, thank you for this language and related work. I have a question. Might it be a good choice as a DSL for inductive programming on your opinion? I mean do some program generation like it done in Magic Haskeller (also there are Djinn, Exference, De-Typechecker, etc), but instead of Template Haskell use minimalist language with dependent typing (which may help with generated algorithm's equality proving by doing deduction between incremental induction iterations).
The text was updated successfully, but these errors were encountered:
Hello there, thank you for this language and related work. I have a question. Might it be a good choice as a DSL for inductive programming on your opinion? I mean do some program generation like it done in Magic Haskeller (also there are Djinn, Exference, De-Typechecker, etc), but instead of Template Haskell use minimalist language with dependent typing (which may help with generated algorithm's equality proving by doing deduction between incremental induction iterations).
The text was updated successfully, but these errors were encountered: