33 citations · 88 across the 9 of their papers we have counts for
9 papers
Nominal Recursors as Epi-Recursors: Extended Technical Report
Andrei Popescu
We study nominal recursors from the literature on syntax with bindings and compare them with respect to expressiveness. The term "nominal" refers to the fact that these recursors o…
Rensets and Renaming-Based Recursion for Syntax with Bindings
Andrei Popescu
I introduce renaming-enriched sets (rensets for short), which are algebraic structures axiomatizing fundamental properties of renaming (also known as variable-for-variable substitu…
Case Studies in Formal Reasoning About Lambda-Calculus: Semantics, Church-Rosser, Standardization and HOAS
Lorenzo Gheri, Andrei Popescu
We have previously published the Isabelle/HOL formalization of a general theory of syntax with bindings. In this companion paper, we instantiate the general theory to the syntax of…
NNLO QCD study of polarised production at the LHC
Rene Poncelet, Andrei Popescu
Longitudinal polarisation of the weak bosons is a direct consequence of Electroweak symmetry breaking mechanism providing an insight into its nature, and is instrumental in searche…
The fate of small classically stable Q-balls
Dmitry Levkov, Emin Nugaev, Andrei Popescu
The smallest classically stable Q-balls are, in fact, generically metastable: in quantum theory they decay into free particles via collective tunneling. We derive general semiclass…
A Formalized General Theory of Syntax with Bindings
Lorenzo Gheri, Andrei Popescu
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are…
Encoding Monomorphic and Polymorphic Types
Jasmin Christian Blanchette, Sascha Böhme, Andrei Popescu +1
Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means…
Foundational Extensible Corecursion
Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel
This paper presents a formalized framework for defining corecursive functions safely in a total setting, based on corecursion up-to and relational parametricity. The end product is…
Security Type Systems as Recursive Predicates
Andrei Popescu
We show how security type systems from the literature of language-based noninterference can be represented more directly as predicates defined by structural recursion on the progra…