Type Inference Verified: Algorithm W in Isabelle/HOL

Type Inference Verified: Algorithm W in Isabelle/HOL

This paper presents the first machine-checked verification of Milner's type inference algorithm W for computing the most general type of an untyped λ-term enriched with let-expressions. This term language is the core of most typed functional programming languages and is also known as Mini-ML. W...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of automated reasoning 1999-11, Vol.23 (3), p.299
Hauptverfasser: Naraschewski, Wolfgang, Nipkow, Tobias
Format: Artikel
Sprache:eng
Schlagworte:
Programming languages
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 3
container_start_page 299
container_title Journal of automated reasoning
container_volume 23
creator Naraschewski, Wolfgang
Nipkow, Tobias
description This paper presents the first machine-checked verification of Milner's type inference algorithm W for computing the most general type of an untyped λ-term enriched with let-expressions. This term language is the core of most typed functional programming languages and is also known as Mini-ML. We show how to model all the concepts involved, in particular types and type schemes, substitutions, and the thorny issue of "new" variables. Only a few key proofs are discussed in detail. The theories and proofs are developed in Isabelle/HOL, the HOL instantiation of the generic theorem prover Isabelle.[PUBLICATION ABSTRACT]
doi_str_mv 10.1023/A:1006277616879
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_1356444411</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2971412551</sourcerecordid><originalsourceid>FETCH-LOGICAL-c159t-4b205fda1cad8df9adec9135b691f90048370cb8357b6866db7ca829e96a67953</originalsourceid><addsrcrecordid>eNotjUtLw0AURgdRMFbXbgdcx96byby6C0VtINBN1WWZxx1NiWlN0oX_3oB-mwNncT7G7hEeEQqxrFYIoAqtFSqj7QXLUGqRg9JwyTKYZa5LIa7ZzTgeAEAg2IyVu58T8bpPNFAfiL_R0KaW4opX3cdxaKfPL_7O257Xo_PUdbTcbJtbdpVcN9LdPxfs9flpt97kzfalXldNHlDaKS99ATJFh8FFE5N1kYJFIb2ymCxAaYSG4I2Q2iujVPQ6OFNYssopbaVYsIe_7mk4fp9pnPaH43no58v9nFHlPETxC_aoRUM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1356444411</pqid></control><display><type>article</type><title>Type Inference Verified: Algorithm W in Isabelle/HOL</title><source>SpringerLink Journals - AutoHoldings</source><creator>Naraschewski, Wolfgang ; Nipkow, Tobias</creator><creatorcontrib>Naraschewski, Wolfgang ; Nipkow, Tobias</creatorcontrib><description>This paper presents the first machine-checked verification of Milner's type inference algorithm W for computing the most general type of an untyped λ-term enriched with let-expressions. This term language is the core of most typed functional programming languages and is also known as Mini-ML. We show how to model all the concepts involved, in particular types and type schemes, substitutions, and the thorny issue of "new" variables. Only a few key proofs are discussed in detail. The theories and proofs are developed in Isabelle/HOL, the HOL instantiation of the generic theorem prover Isabelle.[PUBLICATION ABSTRACT]</description><identifier>ISSN: 0168-7433</identifier><identifier>EISSN: 1573-0670</identifier><identifier>DOI: 10.1023/A:1006277616879</identifier><language>eng</language><publisher>Dordrecht: Springer Nature B.V</publisher><subject>Programming languages ; Studies</subject><ispartof>Journal of automated reasoning, 1999-11, Vol.23 (3), p.299</ispartof><rights>Kluwer Academic Publishers 1999</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c159t-4b205fda1cad8df9adec9135b691f90048370cb8357b6866db7ca829e96a67953</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>Naraschewski, Wolfgang</creatorcontrib><creatorcontrib>Nipkow, Tobias</creatorcontrib><title>Type Inference Verified: Algorithm W in Isabelle/HOL</title><title>Journal of automated reasoning</title><description>This paper presents the first machine-checked verification of Milner's type inference algorithm W for computing the most general type of an untyped λ-term enriched with let-expressions. This term language is the core of most typed functional programming languages and is also known as Mini-ML. We show how to model all the concepts involved, in particular types and type schemes, substitutions, and the thorny issue of "new" variables. Only a few key proofs are discussed in detail. The theories and proofs are developed in Isabelle/HOL, the HOL instantiation of the generic theorem prover Isabelle.[PUBLICATION ABSTRACT]</description><subject>Programming languages</subject><subject>Studies</subject><issn>0168-7433</issn><issn>1573-0670</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNotjUtLw0AURgdRMFbXbgdcx96byby6C0VtINBN1WWZxx1NiWlN0oX_3oB-mwNncT7G7hEeEQqxrFYIoAqtFSqj7QXLUGqRg9JwyTKYZa5LIa7ZzTgeAEAg2IyVu58T8bpPNFAfiL_R0KaW4opX3cdxaKfPL_7O257Xo_PUdbTcbJtbdpVcN9LdPxfs9flpt97kzfalXldNHlDaKS99ATJFh8FFE5N1kYJFIb2ymCxAaYSG4I2Q2iujVPQ6OFNYssopbaVYsIe_7mk4fp9pnPaH43no58v9nFHlPETxC_aoRUM</recordid><startdate>19991101</startdate><enddate>19991101</enddate><creator>Naraschewski, Wolfgang</creator><creator>Nipkow, Tobias</creator><general>Springer Nature B.V</general><scope>7SC</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>19991101</creationdate><title>Type Inference Verified: Algorithm W in Isabelle/HOL</title><author>Naraschewski, Wolfgang ; Nipkow, Tobias</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c159t-4b205fda1cad8df9adec9135b691f90048370cb8357b6866db7ca829e96a67953</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Programming languages</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Naraschewski, Wolfgang</creatorcontrib><creatorcontrib>Nipkow, Tobias</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Journal of automated reasoning</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Naraschewski, Wolfgang</au><au>Nipkow, Tobias</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Type Inference Verified: Algorithm W in Isabelle/HOL</atitle><jtitle>Journal of automated reasoning</jtitle><date>1999-11-01</date><risdate>1999</risdate><volume>23</volume><issue>3</issue><spage>299</spage><pages>299-</pages><issn>0168-7433</issn><eissn>1573-0670</eissn><abstract>This paper presents the first machine-checked verification of Milner's type inference algorithm W for computing the most general type of an untyped λ-term enriched with let-expressions. This term language is the core of most typed functional programming languages and is also known as Mini-ML. We show how to model all the concepts involved, in particular types and type schemes, substitutions, and the thorny issue of "new" variables. Only a few key proofs are discussed in detail. The theories and proofs are developed in Isabelle/HOL, the HOL instantiation of the generic theorem prover Isabelle.[PUBLICATION ABSTRACT]</abstract><cop>Dordrecht</cop><pub>Springer Nature B.V</pub><doi>10.1023/A:1006277616879</doi></addata></record>
fulltext fulltext
identifier ISSN: 0168-7433
ispartof Journal of automated reasoning, 1999-11, Vol.23 (3), p.299
issn 0168-7433
1573-0670
language eng
recordid cdi_proquest_journals_1356444411
source SpringerLink Journals - AutoHoldings
subjects Programming languages
Studies
title Type Inference Verified: Algorithm W in Isabelle/HOL
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T23%3A28%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Type%20Inference%20Verified:%20Algorithm%20W%20in%20Isabelle/HOL&rft.jtitle=Journal%20of%20automated%20reasoning&rft.au=Naraschewski,%20Wolfgang&rft.date=1999-11-01&rft.volume=23&rft.issue=3&rft.spage=299&rft.pages=299-&rft.issn=0168-7433&rft.eissn=1573-0670&rft_id=info:doi/10.1023/A:1006277616879&rft_dat=%3Cproquest%3E2971412551%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1356444411&rft_id=info:pmid/&rfr_iscdi=true