Re:Parallels Between Math and Software Engineering
by mafribe on Sunday August 09, 2015 @06:14PM
(#10031763)
I agree that FP isn't more mathematical than other forms of programming.
No. The operational semantics of any language that has a compiler or interpreter is as well-defined as possible. What you may mean is that the meta-theory of (pure) FP is better understood than the meta-theory of other paradigms, typically because FP has simpler meta-theoretic properties.
This is a non-standard use of the term "axiomatic semantics" which is usually referring to Hoare-logic with pre- and post-conditions. Prolog has (simplifying a bit) a proof-theoretic / proof-search / resolution-unification-based semantics.
That used to be the case, but the last decade has seen extreme progress in this matter, and Hoare logics for imperative languages are routinely used these days.
[ Parent
| on HN ]
There are no comments on this comment yet.