aboutsummaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* some progressDavid Monniaux2022-02-041-0/+108
|
* Merge ../kvx-work into kvx_fp_divisionDavid Monniaux2022-02-036-12/+12
|\
| * Merge remote-tracking branch 'absint/master' into merge_absintDavid Monniaux2022-02-026-12/+12
| |\
| | * Support Coq 8.15.0Xavier Leroy2022-01-311-2/+2
| | |
| | * Adapt w.r.t. coq/coq#15442 (#425)Pierre-Marie Pédrot2022-01-103-6/+6
| | | | | | | | | | | | | | | | | | | | | coq/coq#15442 changes the way `Program` names things, to make it uniform w.r.t. the standard naming schema. This commit removes dependencies on the names chosen by `Program`. Should be backwards compatible. Co-authored-by: Xavier Leroy <xavier.leroy@college-de-france.fr>
| | * Fix pattern for github-linguist.Bernhard Schommer2021-12-141-2/+2
| | |
| | * Enforce evaluation order in IRC.add_interf and IRC.add_prefXavier Leroy2021-12-071-2/+2
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | As written previously, OCaml can evaluate `nodeOfVar g v1` and `nodeOfVar g v2` in any order. Consequently, `v1` and `v2` can be entered in the `varTable` hash table in different order. This can result in different (but equally valid) register allocations. It's better to enforce one evaluation order for the sake of reproducible compilations when the OCaml version changes.
* | | fix path to coq imageDavid Monniaux2022-02-021-1/+1
| | |
* | | update CoqDavid Monniaux2022-02-021-3/+3
| | |
* | | dependency to generate gappa scriptDavid Monniaux2022-02-021-1/+1
| | |
* | | attempts at dealing with gappaDavid Monniaux2022-02-021-1/+8
| | |
* | | full_div_longu_correctDavid Monniaux2022-01-251-2/+28
| | |
* | | some progressDavid Monniaux2022-01-251-2/+66
| | |
* | | attempt at definitionDavid Monniaux2022-01-251-0/+13
| | |
* | | anystep_div_longu_correctDavid Monniaux2022-01-251-0/+38
| | |
* | | big progress on longuDavid Monniaux2022-01-251-9/+61
| | |
* | | some progress?David Monniaux2022-01-251-126/+185
| | |
* | | some progressDavid Monniaux2022-01-241-2/+0
| | |
* | | some progressDavid Monniaux2022-01-241-19/+157
| | |
* | | progressDavid Monniaux2022-01-241-0/+121
| | |
* | | rm spurious functionDavid Monniaux2022-01-241-115/+0
| | |
* | | progressDavid Monniaux2022-01-241-0/+190
| | |
* | | twostep_div_longu_smallb_correctDavid Monniaux2022-01-241-0/+82
| | |
* | | done for small aDavid Monniaux2022-01-241-3/+7
| | |
* | | progressDavid Monniaux2022-01-241-11/+31
| | |
* | | progressDavid Monniaux2022-01-241-7/+17
| | |
* | | progressDavid Monniaux2022-01-241-2/+68
| | |
* | | some progressDavid Monniaux2022-01-241-1/+25
| | |
* | | fix issueDavid Monniaux2022-01-241-5/+66
| | |
* | | progressDavid Monniaux2022-01-241-1/+4
| | |
* | | progressDavid Monniaux2022-01-241-2/+2
| | |
* | | progressDavid Monniaux2022-01-241-3/+17
| | |
* | | progressDavid Monniaux2022-01-241-2/+9
| | |
* | | progressDavid Monniaux2022-01-241-2/+12
| | |
* | | so that it compilesDavid Monniaux2022-01-191-2/+58
| | |
* | | find_quotientDavid Monniaux2022-01-141-0/+64
| | |
* | | find_quotientDavid Monniaux2022-01-141-7/+17
| | |
* | | some more proofDavid Monniaux2022-01-141-6/+15
| | |
* | | some progressDavid Monniaux2022-01-141-0/+75
| | |
* | | relative bound of errorDavid Monniaux2022-01-131-4/+229
| | |
* | | moved functions to a more logical placeDavid Monniaux2022-01-132-191/+180
| | |
* | | more proofs on step1 small bDavid Monniaux2022-01-121-1/+58
| | |
* | | proof progressesDavid Monniaux2022-01-121-6/+38
| | |
* | | proof forwardDavid Monniaux2022-01-121-6/+25
| | |
* | | progress in proofsDavid Monniaux2022-01-121-5/+61
| | |
* | | progress in proofsDavid Monniaux2022-01-121-224/+30
| | |
* | | proof of approx for a/bDavid Monniaux2022-01-121-2/+26
| | |
* | | give a nameDavid Monniaux2022-01-121-1/+5
| | |
* | | more proofsDavid Monniaux2022-01-121-5/+77
| | |
* | | progress in proofsDavid Monniaux2022-01-121-45/+8
| | |