-
Arthur Charguéraud has developed a new version of CFML based on weakest preconditions.
Here are a few URLs:
- [his course on separation logic ](http://www.chargueraud.org/teach/verif/)
- [his co…
-
The HOL build process produces an HTML index in `HOL/help/HOLindex.html`. Would it be possible to have a similar HTML file generated for the CakeML repo? @AndreasLoow suggested that such a feature mig…
-
The task here is to get the CakeML regression test to pass on HOL's experimental (and/or logging) kernels: the only difference should be in generated names, so this means making proofs robust against …
-
Many HOL functions are of the form:
HOL: fac (n:num) = if n = 0 then 1 else n * fac (n-1)
where the subtraction is guaranteed to not underflow on `-` interpreted as subtraction over the i…
-
### Dafny version
4.8.0
### Code to produce this issue
_No response_
### Command to run and resulting output
_No response_
### What happened?
Previously, the Dafny IR generated modules in a lin…
-
The current CakeML grammar is carefully designed to be non-ambiguous, but as a result has a surprising number of non-terminals and is quite involved. For presentation purposes, it would be nice to hav…
-
Certain case expressions are huge within HOL. For such case expressions, the translator produces huge CakeML output, which in turn is highly likely to cause problems for the compiler bootstrapping.
O…
-
Throughout I am utilizing CakeML v2274.
Given two programs, one with and one without nested parentheses in case statements:
```sml
fun fib n =
case (n = 1) of
True => 1
| False =>
case (n =…
-
Summary: in `wordLang`, moving one or two instructions to be after memory loads before they are first read, if possible, can improve performance on pipelined architectures.
More details: `https://lis…
-
Function declarations currently only accept variables as arguments, but in SML one can do pattern matching with a declaration. CakeML AST does not support that, but the parser could generate the corre…