SASyLF logoSASyLF: An Educational Proof Assistant for Language Theory

Teaching and learning formal programming language theory is hard, in part because it's easy to make mistakes and hard to find them.  Proof assistants can help check proofs, but their learning curve is too steep to use in most classes, and is a barrier to researchers too.

SASyLF (pronounced "Sassy Elf") is an LF-based proof assistant specialized to checking theorems about programming languages and logics.  SASyLF has a simple design philosophy: language and logic syntax, semantics, and meta-theory should be written as closely as possible to the way it is done on paper.  SASyLF can express proofs typical of an introductory graduate type theory course.  SASyLF proofs are generally very explicit, but its built-in support for variable binding provides substitution properties for free and avoids awkward variable encodings.





Thanks to our Sponsors!

This work was supported in part by NSF CAREER award CCF-0546550, DARPA grant HR00110710019, the Department of Defense, and an NSF Graduate Research Fellowship for Robert J. Simmons.   Any opinions, findings and conclusions or recomendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF), DARPA, or the Department of Defense.

Indonesian translation of this page courtesy of Jordan Silaen at Hungarian translation of this page courtesy of Elana Pavlet.