Interview With Albert Gräf - Author of the Pure Programming Language

Albert Gräf is the author of the Pure programming language. Pure is a functional programming language based on term rewriting. It has a syntax featuring curried function applications, lexical closures and equational definitions with pattern matching, and thus is somewhat similar to languages of the Haskell and ML variety. Pure is also a dynamic language, and is more like Lisp in this respect. The interpreter has an LLVM backend that does JIT compilation.

Part 1 and Part 2

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

term rewriting vs. pattern matching?

Is there a fundamental difference between pattern matching languages (like the π language or other languages with extensible grammar) and term rewriting languages like pure? To me it looks like two terms for the same concept.