Formal approaches to secure compilation: A survey of fully abstract compilation and related work

M Patrignani, A Ahmed, D Clarke - ACM Computing Surveys (CSUR), 2019 - dl.acm.org
Secure compilation is a discipline aimed at develo** compilers that preserve the security
properties of the source programs they take as input in the target programs they produce as …

The locally nameless representation

A Charguéraud - Journal of automated reasoning, 2012 - Springer
This paper provides an introduction to the locally nameless approach to the representation
of syntax with variable binding, focusing in particular on the use of this technique in formal …

Behavioral polymorphism and parametricity in session-based communication

L Caires, JA Pérez, F Pfenning, B Toninho - … , ESOP 2013, Held as Part of …, 2013 - Springer
We investigate a notion of behavioral genericity in the context of session type disciplines. To
this end, we develop a logically motivated theory of parametric polymorphism, reminiscent of …

Noninterference for free

WJ Bowman, A Ahmed - ACM SIGPLAN Notices, 2015 - dl.acm.org
The dependency core calculus (DCC) is a framework for studying a variety of dependency
analyses (eg, secure information flow). The key property provided by DCC is …

On the versatility of open logical relations: Continuity, automatic differentiation, and a containment theorem

G Barthe, R Crubillé, UD Lago, F Gavazzo - European Symposium on …, 2020 - Springer
Logical relations are one among the most powerful techniques in the theory of programming
languages, and have been used extensively for proving properties of a variety of higher …

On polymorphic sessions and functions: A tale of two (fully abstract) encodings

B Toninho, N Yoshida - ACM Transactions on Programming Languages …, 2021 - dl.acm.org
This work exploits the logical foundation of session types to determine what kind of type
discipline for the Λ-calculus can exactly capture, and is captured by, Λ-calculus behaviours …

Computation focusing

N Rioux, S Zdancewic - Proceedings of the ACM on Programming …, 2020 - dl.acm.org
Focusing is a technique from proof theory that exploits type information to prune inessential
nondeterminism from proof search procedures. Viewed through the lens of the Curry …

Polymorphic session processes as morphisms

B Toninho, N Yoshida - The Art of Modelling Computational Systems: A …, 2019 - Springer
The study of expressiveness of concurrent processes via session types opens a connection
between linear logic and mobile processes, grounded in the rigorous logical background of …

CPS transformation with affine types for call-by-value implicit polymorphism

T Sekiyama, T Tsukada - Proceedings of the ACM on Programming …, 2021 - dl.acm.org
Transformation of programs into continuation-passing style (CPS) reveals the notion of
continuations, enabling many applications such as control operators and intermediate …

[PDF][PDF] Reusability for Mechanized Meta-Theory

S Keuchel - 2018 - soft.vub.ac.be
Computer scientists develop new programming languages and improve existing ones to let
us write better programs faster. One goal is to develop languages with useful meta …