From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!feed.usenet.farm!feeder3.feed.usenet.farm!ecngs!feeder.ecngs.de!81.171.118.63.MISMATCH!peer03.fr7!futter-mich.highwinds-media.com!news.highwinds-media.com!fx43.am4.POSTED!not-for-mail Subject: Re: Why not Coq2Ada program extraction? Newsgroups: comp.lang.ada References: <7b6ae5e8-6604-4d36-b606-ead71f667847@googlegroups.com> <87efiwm3er.fsf@nightsong.com> From: Chris M Moore User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.7.0 MIME-Version: 1.0 In-Reply-To: <87efiwm3er.fsf@nightsong.com> Content-Type: text/plain; charset=utf-8; format=flowed Content-Language: en-GB Content-Transfer-Encoding: 7bit Message-ID: X-Complaints-To: http://netreport.virginmedia.com NNTP-Posting-Date: Tue, 01 May 2018 06:59:38 UTC Organization: virginmedia.com Date: Tue, 1 May 2018 07:59:41 +0100 X-Received-Bytes: 1830 X-Received-Body-CRC: 1386469600 Xref: reader02.eternal-september.org comp.lang.ada:51869 Date: 2018-05-01T07:59:41+01:00 List-Id: On 01/05/2018 04:59, Paul Rubin wrote: > "Dan'l Miller" writes: >> Why hasn't anyone ever developed Ada extraction from Coq proofs? I think we all have day jobs. > That's interesting to hear about Rust. Coq (like Ocaml, Scheme, and > Haskell) is lambda calculus once you look past the types, so extracting > to those languages is natural. This gets back to our earlier > discussion: lambda calculus is a computational model equivalent to a > Turing machine, with unlimited memory. You can translate the lambda > calculus computational part to actual machine code, but you end up > simulating the unlimited memory using garbage collection. There's a > book about it here: > > https://www.microsoft.com/en-us/research/publication/the-implementation-of-functional-programming-languages/ You are not not necessarily forced to use garbage collection when implementing FP. See section 19.3.2 Optimisation Using A Stack Model in the document you reference. Chris -- sig pending (since 1995)