Strongly normalizing audited computation

DOI10.4230/LIPICS.CSL.2017.36zbMATH Open1434.03059arXiv1706.03711MaRDI QIDQ5111206FDOQ5111206

Authors: Wilmer Ricciotti, James Cheney 

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1706.03711

Recommendations

• Explicit auditing
• Justification logic and audited computation
• Justification logic and history based computation
• J-Calc: a typed lambda calculus for intuitionistic justification logic
• Justification logic as a foundation for certifying mobile computation

zbMATH Keywords

justification logiclambda calculusstrong normalizationaudited computation

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Cited In (2)

• Correct audit logging in concurrent systems
• Strongly-Normalizing Higher-Order Relational Queries

This page was built for publication: Strongly normalizing audited computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111206)