TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Writing a Compiler by Proving It Correct

139 pointsby kachnuv_ocasekover 9 years ago

4 comments

hbbioover 9 years ago
Interesting work. I don&#x27;t remember who said that &quot;formal verification is the way of the future... and it&#x27;s going to stay that way!&quot;<p>Quite strange that the article doesn&#x27;t mention CompCert though, which has an extensive bibliography:<p><a href="http:&#x2F;&#x2F;compcert.inria.fr&#x2F;publi.html" rel="nofollow">http:&#x2F;&#x2F;compcert.inria.fr&#x2F;publi.html</a><p>Edit: The person I quote is a researcher in formal verification, I think it&#x27;s Gérard Huet from Inria.
评论 #10577179 未加载
skybrianover 9 years ago
It looks like this compiler never actually reports any errors. (It uses the Maybe type, so you just get nothing.)<p>I appreciate that it&#x27;s a toy compiler, but I really wish people wouldn&#x27;t leave that out. The quality of a compiler&#x27;s user interface almost entirely depends on its error messages, so it&#x27;s important to demonstrate how that&#x27;s done.
评论 #10579021 未加载
nv-vnover 9 years ago
This got me thinking, how feasible would an implementation of APL be as a DSL embedded inside of Agda (or some other similar language)?
fizixerover 9 years ago
And there&#x27;s not one mention of the word &#x27;optimization&#x27;.