Mechanized metatheory for a λ-calculus with trust types.
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Outros Autores: | , |
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 |
Resumo: | 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. |
id |
UFOP_0f9d48872dbd9dcec05bd727a77d51b5 |
---|---|
oai_identifier_str |
oai:localhost:123456789/7173 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Ribeiro, Rodrigo GeraldoFigueiredo, Lucília Camarão deFigueiredo, Carlos Camarão de2017-02-01T12:53:13Z2017-02-01T12:53:13Z2013RIBEIRO, R. G.; FIGUEIREDO, L. C. de; FIGUEIREDO, C. C. de. Mechanized metatheory for a λ-calculus with trust types. Journal of the Brazilian Computer Society, v. 19, n. 4, p. 433-443, nov. 2013. Disponível em: <https://link.springer.com/article/10.1007/s13173-013-0119-5>. Acesso em: 23 jan. 2017.1678-4804http://www.repositorio.ufop.br/handle/123456789/7173https://link.springer.com/article/10.1007/s13173-013-0119-5https://doi.org/10.1007/s13173-013-0119-5As 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.Type systemsProof assistantsSoundness proofsMechanized metatheory for a λ-calculus with trust types.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccessengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-8924http://www.repositorio.ufop.br/bitstream/123456789/7173/2/license.txt62604f8d955274beb56c80ce1ee5dcaeMD52ORIGINALARTIGO_MechanizedMetatheoryCalculus.pdfARTIGO_MechanizedMetatheoryCalculus.pdfapplication/pdf1753365http://www.repositorio.ufop.br/bitstream/123456789/7173/1/ARTIGO_MechanizedMetatheoryCalculus.pdf0fa5688a4cd29d6a2e26764de2464991MD51123456789/71732019-10-21 10:36:02.784oai:localhost:123456789/7173RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-10-21T14:36:02Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.pt_BR.fl_str_mv |
Mechanized metatheory for a λ-calculus with trust types. |
title |
Mechanized metatheory for a λ-calculus with trust types. |
spellingShingle |
Mechanized metatheory for a λ-calculus with trust types. Ribeiro, Rodrigo Geraldo Type systems Proof assistants Soundness proofs |
title_short |
Mechanized metatheory for a λ-calculus with trust types. |
title_full |
Mechanized metatheory for a λ-calculus with trust types. |
title_fullStr |
Mechanized metatheory for a λ-calculus with trust types. |
title_full_unstemmed |
Mechanized metatheory for a λ-calculus with trust types. |
title_sort |
Mechanized metatheory for a λ-calculus with trust types. |
author |
Ribeiro, Rodrigo Geraldo |
author_facet |
Ribeiro, Rodrigo Geraldo Figueiredo, Lucília Camarão de Figueiredo, Carlos Camarão de |
author_role |
author |
author2 |
Figueiredo, Lucília Camarão de Figueiredo, Carlos Camarão de |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Ribeiro, Rodrigo Geraldo Figueiredo, Lucília Camarão de Figueiredo, Carlos Camarão de |
dc.subject.por.fl_str_mv |
Type systems Proof assistants Soundness proofs |
topic |
Type systems Proof assistants Soundness proofs |
description |
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. |
publishDate |
2013 |
dc.date.issued.fl_str_mv |
2013 |
dc.date.accessioned.fl_str_mv |
2017-02-01T12:53:13Z |
dc.date.available.fl_str_mv |
2017-02-01T12:53:13Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
RIBEIRO, R. G.; FIGUEIREDO, L. C. de; FIGUEIREDO, C. C. de. Mechanized metatheory for a λ-calculus with trust types. Journal of the Brazilian Computer Society, v. 19, n. 4, p. 433-443, nov. 2013. Disponível em: <https://link.springer.com/article/10.1007/s13173-013-0119-5>. Acesso em: 23 jan. 2017. |
dc.identifier.uri.fl_str_mv |
http://www.repositorio.ufop.br/handle/123456789/7173 |
dc.identifier.issn.none.fl_str_mv |
1678-4804 |
dc.identifier.uri2.pt_BR.fl_str_mv |
https://link.springer.com/article/10.1007/s13173-013-0119-5 |
dc.identifier.doi.none.fl_str_mv |
https://doi.org/10.1007/s13173-013-0119-5 |
identifier_str_mv |
RIBEIRO, R. G.; FIGUEIREDO, L. C. de; FIGUEIREDO, C. C. de. Mechanized metatheory for a λ-calculus with trust types. Journal of the Brazilian Computer Society, v. 19, n. 4, p. 433-443, nov. 2013. Disponível em: <https://link.springer.com/article/10.1007/s13173-013-0119-5>. Acesso em: 23 jan. 2017. 1678-4804 |
url |
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 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFOP instname:Universidade Federal de Ouro Preto (UFOP) instacron:UFOP |
instname_str |
Universidade Federal de Ouro Preto (UFOP) |
instacron_str |
UFOP |
institution |
UFOP |
reponame_str |
Repositório Institucional da UFOP |
collection |
Repositório Institucional da UFOP |
bitstream.url.fl_str_mv |
http://www.repositorio.ufop.br/bitstream/123456789/7173/2/license.txt http://www.repositorio.ufop.br/bitstream/123456789/7173/1/ARTIGO_MechanizedMetatheoryCalculus.pdf |
bitstream.checksum.fl_str_mv |
62604f8d955274beb56c80ce1ee5dcae 0fa5688a4cd29d6a2e26764de2464991 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP) |
repository.mail.fl_str_mv |
repositorio@ufop.edu.br |
_version_ |
1801685746449383424 |