Hacker News new | ask | show | jobs
by DKordic 3380 days ago
IMHO [[https://en.wikipedia.org/wiki/S-expression][Symbolic Expressions]] are... infinitely better.

Example: '(iff (not (and (P 1) (P 2))) (or (not (P 1)) (not (P 2))) )
2 comments
knight123 3380 days ago
It actually would not be too hard to add a separate parser for S-expressions; this would allow the existing "backend" tooling (converting to postfix, generating trees, filling tables, etc.) to be used unchanged. I actually think this would be a really powerful feature to add; thanks for the idea!
link
DKordic 3379 days ago 

  I forgot to mention SMT-LIB[1] and pySMT[2].  I don't want to say their are optimal, I just think You might find it interesting.  

  I think it would be even better with Curryed[0] Functions.  As an example ``'(f a1 a2)'' is just a Syntactic Sugar for ``'((f a1) a2)''.  

  Don't forget something like `help' in Python :) .
[0]: https://en.wikipedia.org/wiki/Currying [1]: http://www.smtlib.org/ [2]: https://github.com/pysmt/pysmt
link
brudgers 3380 days ago
Greenspun's Tenth Rule: https://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule
link
brudgers 3380 days ago
A Lisp might be a better language choice for that use case than Python. Nothing against Lisps or Python.
link