| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Mini ML
| Title: | Mini ML |
| Authors: | Wolfgang Naraschewski and Tobias Nipkow |
| Submission date: | 2004-03-19 |
| Abstract: | This theory defines the type inference rules and the type inference algorithm W for MiniML (simply-typed lambda terms with let) due to Milner. It proves the soundness and completeness of W w.r.t. the rules. |
| BibTeX: |
@article{MiniML-AFP,
author = {Wolfgang Naraschewski and Tobias Nipkow},
title = {Mini ML},
journal = {Archive of Formal Proofs},
month = mar,
year = 2004,
note = {\url{http://isa-afp.org/entries/MiniML.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |