![texmacs manual texmacs manual](http://www.ibiblio.org/pub/linux/docs/LuCaS/Presentaciones/200304curso-glisa/texmacs/curso-glisa-texmacs-html/vistazo.png)
#Texmacs manual manual
(This points to the Examples section of the Pure manual which quickly gives you an idea how Pure programs look like.) An explanation of this example can be found in the Pure manual. Note that if you remove the take 1000, all Fibonacci numbers will be printed (press Ctrl-C when you get bored). It uses the C puts function to do the printing. You can execute this snippet by typing or pasting it at the Pure interpreter prompt. EXAMPLESĪ little code sample that prints the first 1000 Fibonacci numbers:ĭo (puts.str) (take 1000 (fibs 0L 1L)) with fibs a b = a : fibs b (a+b) & end A fairly extensive collection of addon modules is available, which makes Pure usable as a compiled scripting language for a variety of purposes.īitbucket page for more projects related to Pure. It also integrates nicely with a number of other computing environments, most notably Faust, Pure Data, Octave, Reduce and TeXmacs. It offers many new and powerful features and programs run much faster than their Q equivalents. Pure is the successor of the author's Q language. The interpreter uses LLVM as a backend to JIT-compile Pure programs to fast native code. It offers equational definitions with pattern matching, full symbolic rewriting capabilities, dynamic typing, eager and lazy evaluation, lexical closures, built-in list and matrix support and an easy-to-use C interface.
![texmacs manual texmacs manual](http://www.texmacs.org/tmweb/images/tmwin1079b.png)
Pure is a modern-style functional programming language based on term rewriting. Please click here to go to the new website now. We still keep this Bitbucket site as a (read-only) archive, but all development happens on Github now.