Datasets:
Tasks:
Text Generation
Modalities:
Text
Sub-tasks:
language-modeling
Languages:
English
Size:
100K - 1M
License:
Download formal/hol/Help/ALPHA_UPPERCASE.doc from hoskinson-center/proof-pile: direct link, hf CLI and curl.
- Browser
- Download file 621 Bytes
-
https://huggingface.co/datasets/hoskinson-center/proof-pile/resolve/3d7992e06484fc7cbcb933984a1f6b380e3c703b/formal/hol/Help/ALPHA_UPPERCASE.doc
- Command line
-
hf download hf://datasets/hoskinson-center/proof-pile@3d7992e06484fc7cbcb933984a1f6b380e3c703b/formal/hol/Help/ALPHA_UPPERCASE.doc
-
curl -L -o ALPHA_UPPERCASE.doc https://huggingface.co/datasets/hoskinson-center/proof-pile/resolve/3d7992e06484fc7cbcb933984a1f6b380e3c703b/formal/hol/Help/ALPHA_UPPERCASE.doc
621 Bytes
| \DOC ALPHA | |
| \TYPE {ALPHA : term -> term -> thm} | |
| \SYNOPSIS | |
| Proves equality of alpha-equivalent terms. | |
| \KEYWORDS | |
| rule, alpha. | |
| \DESCRIBE | |
| When applied to a pair of terms {t1} and {t1'} which are | |
| alpha-equivalent, {ALPHA} returns the theorem {|- t1 = t1'}. | |
| { | |
| ------------- ALPHA `t1` `t1'` | |
| |- t1 = t1' | |
| } | |
| \FAILURE | |
| Fails unless the terms provided are alpha-equivalent. | |
| \EXAMPLE | |
| { | |
| # ALPHA `!x:num. x = x` `!y:num. y = y`;; | |
| val it : thm = |- (!x. x = x) <=> (!y. y = y) | |
| # ALPHA `\w. w + z` `\z'. z' + z`;; | |
| val it : thm = |- (\w. w + z) = (\z'. z' + z) | |
| } | |
| \SEEALSO | |
| aconv, ALPHA_CONV, GEN_ALPHA_CONV. | |
| \ENDDOC | |