SwePub - sökning: id:"swepub:oai:research.chalme...

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:5b5bb0d3-1213-4e79-ae67-f1d180d9bdba" "

Sökning: id:"swepub:oai:research.chalmers.se:5b5bb0d3-1213-4e79-ae67-f1d180d9bdba"

Sortera/gruppera träfflistan

Sortering: Träffar per sida:

Numrering	Referens	Omslagsbild	Hitta
1.	Abrahamsson, Oskar, 1986, et al. (författare) Proof-Producing Synthesis of CakeML from Monadic HOL Functions 2020 Ingår i: Journal of Automated Reasoning. - : Springer Science and Business Media LLC. - 0168-7433 .- 1573-0670. ; 64:7, s. 1287-1306 Tidskriftsartikel (refereegranskat)abstract We introduce an automatic method for producing stateful ML programs together with proofs of correctness from monadic functions in HOL. Our mechanism supports references, exceptions, and I/O operations, and can generate functions manipulating local state, which can then be encapsulated for use in a pure context. We apply this approach to several non-trivial examples, including the instruction encoder and register allocator of the otherwise pure CakeML compiler, which now benefits from better runtime performance. This development has been carried out in the HOL4 theorem prover.

Skapa referenser, mejla, bekava och länka

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:5b5bb0d3-1213-4e79-ae67-f1d180d9bdba" "