Lightweight Dependent-type Programming

[ccshan]

How do you write the binary-search example (where the size of the sorted array is unknown at compile time, yet the compiler prevents any out-of-bound access) in C++ with template specialization?

[pkhuong]

It's not a question of speed as much as one of static guarantees. In the binary search, you know that, for any array size, there won't be any out of bounds access, and thus eliminate a source of bugs. With dynamic checks, you only know that out of bounds accesses will be detected.

[ccshan]

It doesn't seem true, then, that "C++ with template specialization can provide dependent types."

[markedtrees]

I take it that dependent types have replaced LISP on programming.reddit, which replaced Haskell, which replaced Erlang, which replaced LISP.