Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
In September of 1998, the College of Engineering at the University of Massachusetts Dartmouth piloted an innovative, integrated, first-year curriculum. It dramatically changed 31 ...
Paul J. Fortier, Emily Fowler, Raymond N. Laoulach...
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...