4 ms·
"Then your typing pass walking over this segment of AST would generate the following (mostly trivial) equations" Thanks for the example. That does seem straigh
by nickpsecurity 11y ago
"Then your typing pass walking over this segment of AST would generate the following (mostly trivial) equations"
Thanks for the example. That does seem straight-forward.
"It's Turing-complete. You can encode anything you want in it."
The reason I mention it is that many people doing proofs and such specifically avoid first-order logic in favor of HOL or Coq. They sometimes mention FOL is too limited or you have to go out of your way for what they're doing. Not specialist enough to have figured out what they're talking about. There appears, though, to be some cutoff point where one is better off using HOL-style tools for analysis, proof, synthesis, whatever. Wish I had references on-hand if it's not clear already what I'm talking about.