Justification logic and audited computation
Justification Logic ( JL ) is a refinement of modal logic in which assertions of knowledge and belief are accompanied by justifications: the formula 〚s〛A states that s is a ‘reason’ for knowing/believing A . We study the computational interpretation of JL via the Curry–Howard isomorphism in which th...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/41571 |
| Acceso en línea: | http://hdl.handle.net/11336/41571 |
| Access Level: | acceso abierto |
| Palabra clave: | Modal Logic Justification Logic Curry Howard Lambda Calculus https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
| Sumario: | Justification Logic ( JL ) is a refinement of modal logic in which assertions of knowledge and belief are accompanied by justifications: the formula 〚s〛A states that s is a ‘reason’ for knowing/believing A . We study the computational interpretation of JL via the Curry–Howard isomorphism in which the modality 〚s〛A is interpreted as: s is a type derivation justifying the validity of A . The resulting lambda calculus is such that its terms are aware of the reduction sequence that gave rise to them. This serves as a basis for understanding systems, many of which belong to the security domain, in which computation is history-aware. |
|---|