| Display title | Software:Larch Prover |
| Default sort key | Larch Prover |
| Page length (in bytes) | 11,586 |
| Namespace ID | 3046 |
| Namespace | Software |
| Page ID | 716526 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>S.Timg |
| Date of page creation | 09:16, 9 February 2024 |
| Latest editor | imported>S.Timg |
| Date of latest edit | 09:16, 9 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The Larch Prover, or LP for short, is an interactive theorem proving system
for multi-sorted first-order logic. It was used at MIT and elsewhere during the 1990s
to reason about designs for circuits, concurrent algorithms, hardware,
and software.
Unlike most theorem provers, which attempt to find... |
