Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 3 of 3
Full-Text Articles in Logic and Foundations
The Algebra Of Type Unification, Verity James Scheel
The Algebra Of Type Unification, Verity James Scheel
Senior Projects Spring 2022
Type unification takes type inference a step further by allowing non-local flow of information. By exposing the algebraic structure of type unification, we obtain even more flexibility as well as clarity in the implementation. In particular, the main contribution is an explicit description of the arithmetic of universe levels and consistency of constraints of universe levels, with hints at how row types and general unification/subsumption can fit into the same framework of constraints. The compositional nature of the algebras involved ensure correctness and reduce arbitrariness: properties such as associativity mean that implementation details of type inference do not leak in …
A Coherent Proof Of Mac Lane's Coherence Theorem, Luke Trujillo
A Coherent Proof Of Mac Lane's Coherence Theorem, Luke Trujillo
HMC Senior Theses
Mac Lane’s Coherence Theorem is a subtle, foundational characterization of monoidal categories, a categorical concept which is now an important and popular tool in areas of pure mathematics and theoretical physics. Mac Lane’s original proof, while extremely clever, is written somewhat confusingly. Many years later, there still does not exist a fully complete and clearly written version of Mac Lane’s proof anywhere, which is unfortunate as Mac Lane’s proof provides very deep insight into the nature of monoidal categories. In this thesis, we provide brief introductions to category theory and monoidal categories, and we offer a precise, clear development of …
Logic -> Proof -> Rest, Maxwell Taylor
Logic -> Proof -> Rest, Maxwell Taylor
Senior Independent Study Theses
REST is a common architecture for networked applications. Applications that adhere to the REST constraints enjoy significant scaling advantages over other architectures. But REST is not a panacea for the task of building correct software. Algebraic models of computation, particularly CSP, prove useful to describe the composition of applications using REST. CSP enables us to describe and verify the behavior of RESTful systems. The descriptions of each component can be used independently to verify that a system behaves as expected. This thesis demonstrates and develops CSP methodology to verify the behavior of RESTful applications.