Incase it doesn't show up:

you are viewing a single comment's thread
view the rest of the comments
[–] 5 points 2 years ago (1 child)

Yeah this only really applies to Algol style imperative languages. Dependent types and say stack languages like idris and apl are dramatically different in their underlying axioms.

  • source
  • parent
  • hideshow 1 child comment
  • [–] 3 points 2 years ago

    Indeed. I have done languages like Prolog and Forth, too, and have actually written a bit in APL ages ago. Yes, they are different, but in the end, it just adds a little bit of complexity. The underlying algorithms are universal, just the methods and structures to achieve them differ. Actually, the first programming language I have written was a simplified Forth derivate - in 6510 Assembler.

  • source
  • parent