14 citations · 34 across the 11 of their papers we have counts for
7 papers · 1 filter
Bouncing threads for infinitary and circular proofs
David Baelde, Amina Doumane, Denis Kuperberg +1
We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed to take into account a…
A Reduced Semantics for Deciding Trace Equivalence
David Baelde, Stéphanie Delaune, Lucca Hirschi
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be de…
Combining Deduction Modulo and Logics of Fixed-Point Definitions
David Baelde, Gopalan Nadathur
Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point defin…
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Zachary Snow, David Baelde, Gopalan Nadathur
Dependently typed lambda calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types" not…
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Zachary Snow, David Baelde, Gopalan Nadathur
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and t…
Least and Greatest Fixed Points in Linear Logic
David Baelde
The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior.…