• Aucun résultat trouvé

The CakeML Verified Compiler and Toolchain

N/A
N/A
Protected

Academic year: 2022

Partager "The CakeML Verified Compiler and Toolchain"

Copied!
1
0
0

Texte intégral

(1)

The CakeML Verified Compiler and Toolchain

(Invited Talk)

Magnus O. Myreen

Chalmers University of Technology, Sweden

Abstract.

The CakeML project has built an ecosystem of proofs and tools around an ML dialect called CakeML. The ecosystem includes a proven-correct compiler that can bootstrap itself within the logic of an interactive the- orem prover (HOL4).

In this talk, I will give an overview of the entire ecosystem; I will show how HOL4 provides an architecture that scales to such large develop- ments; and I will explain where and how the CakeML project uses proof automation. The talk will conclude with a discuss of where I believe CakeML would gain most from improved proof automation.

For more:https://cakeml.org/

1

Références

Documents relatifs

This paper extends the literature on motherhood (Banister, Hogg, & Dixon, 2010; Banister & Hogg, 2006; Voice Group, 2010a and 2010b; Thomsen &Sørensen,

Nevertheless, their dichotomous behaviour is clearly shown from our datasets, and at least two highly promising perspectives arise from our results: (1) synchrotron X-ray fluorescence

……… name on it.The girl sitting next to her smiled and made Renu feel (good ) ……… than before.Her name was Kayla.Renu smiled back at

Appearance, condition, feelings bad, feelings good, shape, size, sound, time, taste, touch, said, funny, scary, commentary, analysis of text, physical qualities, mental

Kalliopi (Kalli) Stilos, RN, MScN, CHPCN(C), Advance Practice Nurse for the Palliative Care Consult Team, Sunnybrook Health Science Centre, 2075 Bayview Avenue, Room

If ESPS data do not allow the precise distinc- tion between work contracts of less than twelve months, they provide information on some work contract characteristics used to

2 This naive algorithm can be improved and it is possible to obtain a word complexity in O(n) (A. Weilert 2000) using a divide and conquer approach... Show how the LLL algorithm gives

Recycling
programs
in
St.
John’s
are
inefficient,
and
are
having
a
negative
impact
upon
the