Datasets:
Tasks:
Text Generation
Modalities:
Text
Sub-tasks:
language-modeling
Languages:
English
Size:
100K - 1M
License:
Download formal/hol/Help/BINOP_CONV.doc from hoskinson-center/proof-pile: direct link, hf CLI and curl.
- Browser
- Download file 750 Bytes
-
https://huggingface.co/datasets/hoskinson-center/proof-pile/resolve/3d7992e06484fc7cbcb933984a1f6b380e3c703b/formal/hol/Help/BINOP_CONV.doc
- Command line
-
hf download hf://datasets/hoskinson-center/proof-pile@3d7992e06484fc7cbcb933984a1f6b380e3c703b/formal/hol/Help/BINOP_CONV.doc
-
curl -L -o BINOP_CONV.doc https://huggingface.co/datasets/hoskinson-center/proof-pile/resolve/3d7992e06484fc7cbcb933984a1f6b380e3c703b/formal/hol/Help/BINOP_CONV.doc
750 Bytes
| \DOC BINOP_CONV | |
| \TYPE {BINOP_CONV : conv -> conv} | |
| \SYNOPSIS | |
| Applies a conversion to both arguments of a binary operator. | |
| \DESCRIBE | |
| If {c} is a conversion where {c `l`} returns {|- l = l'} and {c `r`} returns | |
| {|- r = r'}, then {BINOP_CONV c `op l r`} returns {|- op l r = op l' r'}. The | |
| term {op} is arbitrary, but is often a constant such as addition or | |
| conjunction. | |
| \FAILURE | |
| Never fails when applied to the conversion. But may fail when applied to the | |
| term if one of the core conversions fails or returns an inappropriate theorem | |
| on the subterms. | |
| \EXAMPLE | |
| { | |
| # BINOP_CONV NUM_ADD_CONV `(1 + 1) * (2 + 2)`;; | |
| val it : thm = |- (1 + 1) * (2 + 2) = 2 * 4 | |
| } | |
| \SEEALSO | |
| ABS_CONV, BINOP2_CONV, COMB_CONV, COMB2_CONV, RAND_CONV, RATOR_CONV. | |
| \ENDDOC | |