Mirror of https://github.com/leanprover/lean2 in case it ever disappears
8912c759dd
The token '?(' is used to represent inaccessible terms in recursive
equations. In the rewriter tactic, we want "rewrite ?(t)" to be parsed
as "? (t)".
|
||
|---|---|---|
| bin | ||
| doc | ||
| examples | ||
| hott | ||
| images | ||
| library | ||
| script | ||
| src | ||
| tests | ||
| .gitignore | ||
| .travis.osx.yml | ||
| .travis.windows.yml | ||
| .travis.yml | ||
| LICENSE | ||
| README.md | ||
| License | Windows | Ubuntu | OS X | Coverage | Builds/Tests | Static Analysis |
|---|---|---|---|---|---|---|
 |
 |
 |
 |
 |
 |
 |
About
- Theorem Proving in Lean: HTML, PDF
- Authors
- Library
- Short Tutorial
- To Do list
Requirements
- C++11 compatible compiler: g++ (version >= 4.8.1), or clang++ (version >= 3.3)
- CMake
- GMP (GNU multiprecision library)
- MPFR (GNU MPFR Library)
- Lua 5.2 or 5.1, or LuaJIT 2.0
- (optional) gperftools
- (optional) Boost (version >= 1.54), we can build Lean using boost::thread instead of std::thread. When using Boost, Lean can modify the thread stack size.
Installing required packages at
Windows
Linux
OS X
Build Instructions
Miscellaneous
- Testing and Code Coverage
- Building Doxygen Documentation:
doxygen src/Doxyfile - Coding Style
- Git Commit Convention
- Automatic Builds
- Syntax Highlight Lean Code in LaTeX