A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq

A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq

We demonstrate for the first time that Liquid Haskell, a refinement type checker for Haskell programs, can be used for arbitrary theorem proving by verifying a parallel, monoidal string matching algorithm implemented in Haskell. We use refinement types to specify correctness properties, Haskell term...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Vazou, Niki, Lampropoulos, Leonidas, Polakow, Jeff
Format: Tagungsbericht
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 74
container_issue 10
container_start_page 63
container_title
container_volume 52
creator Vazou, Niki
Lampropoulos, Leonidas
Polakow, Jeff
description We demonstrate for the first time that Liquid Haskell, a refinement type checker for Haskell programs, can be used for arbitrary theorem proving by verifying a parallel, monoidal string matching algorithm implemented in Haskell. We use refinement types to specify correctness properties, Haskell terms to express proofs of these properties, and Liquid Haskell to check the proofs. We evaluate Liquid Haskell as a theorem prover by replicating our 1428 LoC proof in a dependently-typed language (Coq - 1136 LoC). Finally, we compare both proofs, uncovering the relative advantages and disadvantages of the two provers.
doi_str_mv 10.1145/3156695.3122963
format Conference Proceeding
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3156695_3122963</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_3156695_3122963</sourcerecordid><originalsourceid>FETCH-LOGICAL-c125t-db31558b8cd3499f1c5ef9dbe8f83d8cbf5abd133ddb3bdd44341c09fae3dadb3</originalsourceid><addsrcrecordid>eNotkM1OwzAQhC0EEqFw5uoXSOvN2lHMrYqAVqrEAThHjn_AkMatHUB9exLIZXdntBqNPkJugS0BuFghiLKUYolQFLLEM5KBEFUOULJzkjEsixyQs0tyldIHYwxZUWXkeU0H1VkaHB1-Aj3E8G1juqPj9O7k-ze6D33wRnU0DfFPq0G_T4fvaeePX97QjUqftuuo6g2tw_GaXDjVJXsz7wV5fbh_qTf57ulxW693uYZCDLlpcWrYVtogl9KBFtZJ09rKVWgq3TqhWgOIZvxsjeEcOWgmnbJo1OgtyOo_V8eQUrSuOUS_V_HUAGsmJs3MpJmZ4C9n0VXH</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq</title><source>ACM Digital Library Complete</source><creator>Vazou, Niki ; Lampropoulos, Leonidas ; Polakow, Jeff</creator><creatorcontrib>Vazou, Niki ; Lampropoulos, Leonidas ; Polakow, Jeff</creatorcontrib><description>We demonstrate for the first time that Liquid Haskell, a refinement type checker for Haskell programs, can be used for arbitrary theorem proving by verifying a parallel, monoidal string matching algorithm implemented in Haskell. We use refinement types to specify correctness properties, Haskell terms to express proofs of these properties, and Liquid Haskell to check the proofs. We evaluate Liquid Haskell as a theorem prover by replicating our 1428 LoC proof in a dependently-typed language (Coq - 1136 LoC). Finally, we compare both proofs, uncovering the relative advantages and disadvantages of the two provers.</description><identifier>ISSN: 0362-1340</identifier><identifier>EISSN: 1558-1160</identifier><identifier>DOI: 10.1145/3156695.3122963</identifier><language>eng</language><ispartof>SIGPLAN notices, 2017, Vol.52 (10), p.63-74</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c125t-db31558b8cd3499f1c5ef9dbe8f83d8cbf5abd133ddb3bdd44341c09fae3dadb3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Vazou, Niki</creatorcontrib><creatorcontrib>Lampropoulos, Leonidas</creatorcontrib><creatorcontrib>Polakow, Jeff</creatorcontrib><title>A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq</title><title>SIGPLAN notices</title><description>We demonstrate for the first time that Liquid Haskell, a refinement type checker for Haskell programs, can be used for arbitrary theorem proving by verifying a parallel, monoidal string matching algorithm implemented in Haskell. We use refinement types to specify correctness properties, Haskell terms to express proofs of these properties, and Liquid Haskell to check the proofs. We evaluate Liquid Haskell as a theorem prover by replicating our 1428 LoC proof in a dependently-typed language (Coq - 1136 LoC). Finally, we compare both proofs, uncovering the relative advantages and disadvantages of the two provers.</description><issn>0362-1340</issn><issn>1558-1160</issn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2017</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkM1OwzAQhC0EEqFw5uoXSOvN2lHMrYqAVqrEAThHjn_AkMatHUB9exLIZXdntBqNPkJugS0BuFghiLKUYolQFLLEM5KBEFUOULJzkjEsixyQs0tyldIHYwxZUWXkeU0H1VkaHB1-Aj3E8G1juqPj9O7k-ze6D33wRnU0DfFPq0G_T4fvaeePX97QjUqftuuo6g2tw_GaXDjVJXsz7wV5fbh_qTf57ulxW693uYZCDLlpcWrYVtogl9KBFtZJ09rKVWgq3TqhWgOIZvxsjeEcOWgmnbJo1OgtyOo_V8eQUrSuOUS_V_HUAGsmJs3MpJmZ4C9n0VXH</recordid><startdate>20171031</startdate><enddate>20171031</enddate><creator>Vazou, Niki</creator><creator>Lampropoulos, Leonidas</creator><creator>Polakow, Jeff</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20171031</creationdate><title>A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq</title><author>Vazou, Niki ; Lampropoulos, Leonidas ; Polakow, Jeff</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c125t-db31558b8cd3499f1c5ef9dbe8f83d8cbf5abd133ddb3bdd44341c09fae3dadb3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2017</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Vazou, Niki</creatorcontrib><creatorcontrib>Lampropoulos, Leonidas</creatorcontrib><creatorcontrib>Polakow, Jeff</creatorcontrib><collection>CrossRef</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Vazou, Niki</au><au>Lampropoulos, Leonidas</au><au>Polakow, Jeff</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq</atitle><btitle>SIGPLAN notices</btitle><date>2017-10-31</date><risdate>2017</risdate><volume>52</volume><issue>10</issue><spage>63</spage><epage>74</epage><pages>63-74</pages><issn>0362-1340</issn><eissn>1558-1160</eissn><abstract>We demonstrate for the first time that Liquid Haskell, a refinement type checker for Haskell programs, can be used for arbitrary theorem proving by verifying a parallel, monoidal string matching algorithm implemented in Haskell. We use refinement types to specify correctness properties, Haskell terms to express proofs of these properties, and Liquid Haskell to check the proofs. We evaluate Liquid Haskell as a theorem prover by replicating our 1428 LoC proof in a dependently-typed language (Coq - 1136 LoC). Finally, we compare both proofs, uncovering the relative advantages and disadvantages of the two provers.</abstract><doi>10.1145/3156695.3122963</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0362-1340
ispartof SIGPLAN notices, 2017, Vol.52 (10), p.63-74
issn 0362-1340
1558-1160
language eng
recordid cdi_crossref_primary_10_1145_3156695_3122963
source ACM Digital Library Complete
title A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T17%3A36%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20tale%20of%20two%20provers:%20verifying%20monoidal%20string%20matching%20in%20liquid%20Haskell%20and%20Coq&rft.btitle=SIGPLAN%20notices&rft.au=Vazou,%20Niki&rft.date=2017-10-31&rft.volume=52&rft.issue=10&rft.spage=63&rft.epage=74&rft.pages=63-74&rft.issn=0362-1340&rft.eissn=1558-1160&rft_id=info:doi/10.1145/3156695.3122963&rft_dat=%3Ccrossref%3E10_1145_3156695_3122963%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true