DeepAI AI Chat
Log In Sign Up

Explicit Auditing

by   Wilmer Ricciotti, et al.

The Calculus of Audited Units (CAU) is a typed lambda calculus resulting from a computational interpretation of Artemov's Justification Logic under the Curry-Howard isomorphism; it extends the simply typed lambda calculus by providing audited types, inhabited by expressions carrying a trail of their past computation history. Unlike most other auditing techniques, CAU allows the inspection of trails at runtime as a first-class operation, with applications in security, debugging, and transparency of scientific computation. An efficient implementation of CAU is challenging: not only do the sizes of trails grow rapidly, but they also need to be normalized after every beta reduction. In this paper, we study how to reduce terms more efficiently in an untyped variant of CAU by means of explicit substitutions and explicit auditing operations, finally deriving a call-by-value abstract machine.


page 1

page 2

page 3

page 4


The Undecidability of Unification Modulo σ Alone

The rewriting system sigma is the set of rules propagating explicit subs...

The Bang Calculus and the Two Girard's Translations

We study the two Girard's translations of intuitionistic implication int...

A Core Calculus for Static Latency Tracking with Placement Types

Developing efficient geo-distributed applications is challenging as prog...

Implementing distributed λ-calculus interpreter

This paper describes how one can implement distributed λ-calculus interp...

Analytical Differential Calculus with Integration

Differential lambda-calculus was first introduced by Thomas Ehrhard and ...

Reasonable Space for the λ-Calculus, Logarithmically

Can the λ-calculus be considered as a reasonable computational model? Ca...

On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms

Felty and Miller have described what they claim to be a faithful encodin...