Mechanized Metatheory for a λ-Calculus with Trust Types


As computer programs become increasingly complex, techniques for ensuring trustworthiness of information manipulated by them become critical. In this work, we use the Coq proof assistant to formalize a λ-calculus with trust types, originally formulated by Ørbæk and Palsberg. We give formal proofs of type soundness, erasure and simulation theorems and also… (More)

4 Figures and Tables


  • Presentations referencing similar topics