• bss03@infosec.pub
    link
    fedilink
    English
    arrow-up
    10
    ·
    12 hours ago

    Honestly, I think CS research has hinted we were going in this direction anyway. Dependently-typed languages like Idris and Agda have as term-inference for a while, it was based on exhaustive type-directed heuristically-prioritized search but it could still auto-complete/fill some non-trivial code, and Roq tactics could also make things that were disastrously wordy read much more simply and they are effectively a form of compile-time function (Elaborator Reflection is probably a better approach, but Roq’s two-language model is much more well-established).

    Even without quite so interesting types, there were academic exercises like “Djinn” that could exhaustively enumerate lambda-calculus function bodies given the parametrically polymorphic type signature and a library of standard functions, and that’s been available for 14+ years? In an entirely different direction we’ve had SMT solvers can could be plugged in to a few languages to verify a LOT of properties that can be expressed in first-order logic.

    Still, I think there’s plenty of magic, it’s just not in the places we can lay down (enough) axioms around symbolic structure / grammars.