Also interested in: - What logics form the core of modern proof assistants? - How is verification done efficiently? e.g. how is SMT integrated? - What are the hard parts of building a real-world proof assistant? e.g. it's easy to make an STLC interpreter, but hard to make OCaml
-
-
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Not sure if it's what you're looking for, but here's a pretty good tutorial for implementing a dependently typed language https://www.andres-loeh.de/LambdaPi/
-
Yes, I'd also like to know how much implementing a dependently-typed language would answer my questions. (I have a copy of The Little Typer that I keep meaning to revisit...) The relationship between dependent types <-> theorem proving is still not 100% clear to me.
- Show replies
New conversation -
-
-
Jeremy Avigad taught a course (I didn't take) in the philosophy dept 2 semesters ago. Unfortunately the online syllabus is sparse but you could reach out to him for the material? http://www.andrew.cmu.edu/user/avigad/itp/ …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
are you considering linear/adjoint logic?
-
Nothing's off the table! But I'd like to start with whatever logics are most commonly used for proof assistants.
- Show replies
New conversation -
-
-
My favourites: * Basics: https://andres-loeh.de/LambdaPi/ * (Relatively) simple version of higher order unification: http://adam.gundry.co.uk/pub/pattern-unify/ … * Implementing dependent type checking using Racket Macros: https://dl.acm.org/doi/10.1145/33 * Another typechecking tutorial: http://www.davidchristiansen.dk/tutorials/nbe/
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
cognitive psychology. PhD