Reynolds's defunctionalization technique is a whole-program transformation from higher-
order to first-order functional programs. We study practical applications of this transformation …

It is well-known that many environment-based abstract machines can be seen as strategies
in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear …

The evaluation function of a reduction semantics (ie, a small-step operational semantics with
an explicit representation of the reduction context) is canonically defined as the transitive …

Whether the number of β-steps in the λ-calculus can be taken as a reasonable time cost
model (that is, polynomially related to the one of Turing machines) is a delicate problem …

This paper presents matching logic, a first-order logic (FOL) variant for specifying and
reasoning about structure by means of patterns and pattern matching. Its sentences, the …

The realization of a language design requires multiple artifacts that redundantly encode the
same information. This entails significant effort for language implementors, and often results …

This paper shows how rewriting logic semantics (RLS) can be used as a computational logic
framework for operational semantic definitions of programming languages. Several …

This paper presents a verification framework that is parametric in a (trusted) operational
semantics of some programming language. The underlying proof system is language …

Abstract machines for functional languages rely on the notion of environment, a data
structure storing the previously encountered and delayed beta-redexes. This paper provides …

In CSL-LICS 2014, Accattoli and Dal Lago [1] showed that there is an implementation of the
ordinary (ie strong, pure, call-by-name) λ-calculus into models like RAM machines which is …