In this paper we generalise the notion of extensional (functional) equivalence of programs to
abstract equivalences induced by abstract interpretations. The standard notion of …

There have been investigations into type-theoretic foundations for metaprogramming,
notably Davies and Pfenning's (2001) treatment in S4 modal logic, where code evaluating to …

The use of a necessity modality in a typed λ-calculus can be used to separate it into two
regions. These can be thought of as intensional vs. extensional data: data in the first region …

Context: analyzing/verifying software projects during development to:• detect and report
bugs as early as possible (eg, on-the-fly, at commit,…),• optimize code and libraries globally …

Intensionality is a phenomenon that occurs in logic and computation. In the most general
sense, a function is intensional if it operates at a level finer than (extensional) equality. This …

The use of a necessity modality in a typed $\lambda $-calculus can be used to separate it
into two regions. These can be thought of as intensional vs. extensional data: data in the first …

Functors with an instance of the Traversable type class can be thought of as data structures
which permit a traversal of their elements. This has been made precise by the …

Theorem provers such as Lean and Coq use metaprogramming to automate proof-writing,
making the process less tedious. These theorem provers are all variations of Martin-Löf's …

Noninterference properties state that data does not flow in an undesirable manner, eg from a
high-security to a low-security setting. Within programming languages noninterference is …

Automatic static analysis tools allow inferring properties about software without executing it
and without the need for human interaction. When these tools are based on formal methods …