u/mttdin r/ProgrammingLanguages • Recommends
Constraint Solvers for the Working PL Researcher
0:00 / 0:00
#z3#smtsolver#programsynthesis
Constraint Solvers for the Working PL Researcher - Nadia Polikarpova at PLMW@ICFP
UCSD Programming Systems
88 subscribers • 1 video on Hallway
- Recommended by 1 person: 1 in engineering communities.
- Presented by Nadia Polikarpova, Assistant Professor at UCSD
Advanced. Deep dive for people who know the field.
1.6K views6 years ago1 recommendation
Computer scienceProgramming languagesFormal methods and verificationAlgorithms
Nadia Polikarpova demonstrates how to use the Z3 SMT solver for declarative programming, program verification, and program synthesis.
Pre-recorded version of the talk Nadia Polikarpova gave at PLMW@ICFP'20. The talk demonstrates how to use the Z3 SMT solver for declarative programming, program verification, and program synthesis.Why it's here
1 person recommends thisWhat people say. Recommended as an excellent introduction to using SMT solvers like Z3 for programming language research.
u/FixedPointerin r/ProgrammingLanguages • Mentions
On “Is learning theorem provers useful in PL research?”
You can fall down the rabbit hole of "Propositions as Types" and "Programs as Proofs" that comes from the Curry-Howard correspondence, but IMHO the value in checking these tools depends on what you want to do.
I really recommend the following video by Nadia Polikarpova, which illustrates how these type of tools might be useful when working in PL. If they suit your needs, then they may be worth looking into.
[video