Making Substitutions Explicit in SASyLf

dc.contributor.advisorJohn Boyland
dc.contributor.committeememberEthan V. Munson
dc.contributor.committeememberChristine Cheng
dc.creatorAriotti, Michael David
dc.date.accessioned2025-01-16T18:04:29Z
dc.date.available2025-01-16T18:04:29Z
dc.date.issued2017-08-01
dc.description.abstractSASyLF is an interactive proof assistant whose goal is to teach: about type systems, language meta-theory, and writing proofs in general. This software tool stores user-specified languages and logics in the dependently-typed LF, and its internal proof structure closely resembles M2+ . This thesis describes a new usability feature of SASyLF, “where” clauses, which make explicit previously hidden substitutions that arise through constructs in the proof code, primarily case analyses. An overview of SASyLF and logical frameworks is given, with motivating examples. The requirements for “where” clauses are discussed, including a formal definition of correctness. The feature’s implementation in SASyLF is outlined, and future extensions are discussed.
dc.identifier.urihttp://digital.library.wisc.edu/1793/85910
dc.relation.replaceshttps://dc.uwm.edu/etd/1576
dc.subjectEducation
dc.subjectLF
dc.subjectM2+
dc.subjectProof Assistant
dc.subjectSASyLF
dc.subjectUnification
dc.titleMaking Substitutions Explicit in SASyLf
dc.typethesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Wisconsin-Milwaukee
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Ariotti_uwm_0263m_11900.pdf
Size:
411.57 KB
Format:
Adobe Portable Document Format
Description:
Main File