How do I include the Hacl* library in the lib folder when extracting my code to OCaml?

Currently I am stuck with this, which can extract successfully for F* codes only using the F* libraries.

fstar.exe  --z3cliopt 'timeout=600000' --use_hints --use_hint_hashes  --odir out --codegen OCaml <modulename>.fst
OCAMLPATH="../../fstar/bin" ocamlfind opt -package fstarlib -linkpkg -g  out/<m

After #829, it is all squashed on a single line. One option is to pass it through rustfmt, but we should make sure that's not adding too much compilation time. Also that would only work on nightly (I think) so if we ever want to switch to stable it may be a problem.

Currently the file group_theory/order_of_element is quite a mess: https://github.com/leanprover-community/mathlib/blob/master/src/group_theory/order_of_element.lean

• The first 10-15 declarations belong to other files
• There is no additive version of the story. Need to add to_additive everywhere.

https://asciinema.org

Consider changing warnings "found topics with non-existent parents"
into errors, just as we already treat broken links as errors. A
simple fix might be to replace the following code in the definition of
function save-json-files, in file books/xdoc/save-fancy.lisp.

    (or (not orphans)
        (cw "~|~%WARNING: found topics with non-existent parents:~%~x0~%These ~

The TlaDocumentSymbolsProvider stumbles on operators while parsing constants and doesn't report them as model symbols. As a result, const operator names don't appear in the outline panel and in completion suggestions. Such operators also prevent parsing of the following constants.

A simple case:

CONSTANT Foo(_), Bar

Neither Foo nor Bar makes it to the model symbols list

We believe that the term “normal weak residual” is more appropriate than the term “standard weak residual”. The term “normal weak residual” is being used already in @jeltsch’s WFLP ’19 contribution. Our goal is to switch to this term in identifiers and documentation.

"A Process Calculus for Formal

Description

Only partial satisfiable spec for square root function in Web documentation.

Steps to Reproduce

Documentation on http://overturetool.org/languages/
Text:
"For example, a function SQRT for calculating a square root of a natural number might be defined as follows: ... "

Expected behavior:

A general satisfiable specification defines an eps > 0 for the distanc

When building the IP sniffer test, I forgot to run Verify_Message before checking Structural_Valid_Message. While this was not a correctness issue (the context of cause was invalid), it took me some time to realize that. I wonder if we should add a predicate to those convenience operations that work on a whole message that states/requires that a verification has been attempted on a context. Th

The following model is accepted by TorXakis:

PROCDEF p [Input1, Input2 :: Int; Output :: Int] () ::=
        Input1 ? x 
    >-> Input2 ? y [[ x <> y ]] 
    >-> Output ! x + y | Input1 ?x | Input2 ?y [[ x == y ]]
    >-> Output ! x + y
    >-> STOP
ENDDEF

CHANDEF chans ::= Input1,Input2, Output :: Int ENDDEF

MODELDEF M ::=
    CHAN IN Input1, Input2
    CHAN OUT Output
    SY

For example, if two alpha-equivalent nodes appear twice in the same path, probably something has gone wrong.

We can improve the accuracy of pruning by developing assertions on the log/path.