Live briefing
Everything about Pure (programming language)
Functional programming language
Pure, successor to the equational language Q, is a dynamically typed, functional programming language based on term rewriting. It has facilities for user-defined operator syntax, macros, arbitrary-precision arithmetic, and compiling to native code through LLVM. Pure is free and open-source software distributed (mostly) under the GNU Lesser General Public License version 3 or later. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Pure (programming language)A 5-minute orientation
- Pick up a classic book: Clean CodeThe most-reprinted book on the subject
- Read the landmark paper: High-performance end-user analysis in pure Julia programming languageCited 2 times
- Go sideways: Haskell featuresA closely related topic
- Go sideways: Mercury (programming language)A closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
đź“š Books worth reading
Clean CodeRobert C. Martin · 2008
Purely functional data structuresChris Okasaki · 1998
Understanding object-oriented programming with JavaTimothy Budd · 1998
Pure CorbaFintan Bolton · 2001
SystemVerilog for VerificationChris Spear · 2006
Let Us C++Yashavant Kanetkar · 2002
Enterprise JavaBeans by exampleHenri Jubin, Jurgen Friedrichs · 1999
Real World HaskellBryan O'Sullivan, John Goerzen · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Haskell features This article describes the features in the programming language Haskell. A simple example that is often used to demonstrate the syntax of functional languages…
- Mercury (programming language) Mercury is a functional logic programming language made for real-world uses. The first version was developed at the University of Melbourne, Computer Science…
- Macaulay2 Macaulay2 is a free computer algebra system created by Daniel Grayson (from the University of Illinois at Urbana–Champaign) and Michael Stillman (from…
- Pushout (category theory) In category theory, a branch of mathematics, a pushout (also called a fibered coproduct or fibered sum or cocartesian square or amalgamated sum) is the…
- Job-shop scheduling Job-shop scheduling, the job-shop problem (JSP) or job-shop scheduling problem (JSSP) is an optimization problem in computer science and operations research…
- Standard ML Standard ML (SML) is a general-purpose, high-level, modular, functional programming language with compile-time type checking and type inference. It is…
- General number field sieve In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100. Heuristically…
- Lauricella hypergeometric series In 1893 Giuseppe Lauricella defined and studied four hypergeometric series FA, FB, FC, FD of three variables. They are (Lauricella 1893): FA(3)(a,b1,b2…