This new version seems slicker than the CF definitions and automation used in CakeML's version of CF, which are based on Charguéraud's previous version of CFML.
This issue is about developing a CakeML version of Charguéraud's new CFML.
It would be good if the new CF for CakeML would be compatible with the current CF for CakeML. In particular, it would be good if app theorems proved in one are equivalent to app theorems proved in the other.
Arthur Charguéraud has developed a new version of CFML based on weakest preconditions.
Here are a few URLs:
This new version seems slicker than the CF definitions and automation used in CakeML's version of CF, which are based on Charguéraud's previous version of CFML.
This issue is about developing a CakeML version of Charguéraud's new CFML.
It would be good if the new CF for CakeML would be compatible with the current CF for CakeML. In particular, it would be good if
app
theorems proved in one are equivalent toapp
theorems proved in the other.