<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Combining Static and Dynamic Contract Checking for Curry · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1709.04816/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1709.04816/feed.xml" rel="self" type="application/rss+xml" /><item><title>Combining Static and Dynamic Contract Checking for Curry — mentioned by rrobukef</title><link>https://news.ycombinator.com/item?id=19683849</link><guid isPermaLink="false">urn:hackerpapers:mention:1709.04816:19683849</guid><pubDate>Wed, 17 Apr 2019 16:12:16 GMT</pubDate><description>&lt;p&gt;Deductive verification is a large extension of designing by contract: The addition of a SMT solver to verify the contracts at compile time for instance. On the other hand libhoare only adds the contracts as a runtime addition with no mention of formally verifying these. The same with the RFC, it dismissed automatic verification: &amp;quot;Automated proof systems are very hard, especially when AFAIK Rust&amp;#x27;s type system doesn&amp;#x27;t even have partial formal proofs yet.&amp;quot; This paper shows a similar approach to OP&amp;#x27;s but applied to Curry: https://arxiv.org/abs/1709.04816. It shows how no formal proofs are needed.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1709.04816/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
