Mechanized metatheory for a λ-calculus with trust types.

• Autor(a) principal: Ribeiro, Rodrigo Geraldo
• Data de Publicação: 2013
• Outros Autores: Figueiredo, Lucília Camarão de, Figueiredo, Carlos Camarão de
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UFOP
• Texto Completo: http://www.repositorio.ufop.br/handle/123456789/7173; https://link.springer.com/article/10.1007/s13173-013-0119-5; https://doi.org/10.1007/s13173-013-0119-5
• topic: Type systems; Proof assistants; Soundness proofs

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 formalise 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 prove decidability of the typing problem. As a result of our formalisation a certified type checker is derived.