| Publication | Date of Publication | Type |
|---|
Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
Lecture Notes in Computer Science | 2023-06-28 | Paper |
An improved general E-unification method
| 2023-04-28 | Paper |
Some lambda calculi with categorical sums and products
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Some independence results for equational unification
Rewriting Techniques and Applications | 2022-12-09 | Paper |
A realizability interpretation for intersection and union types
Programming Languages and Systems | 2016-12-21 | Paper |
Exploring theories with a model-finding assistant
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
Intersection and union types in the \(\bar{\lambda}\mu\tilde{\mu}\)-calculus
| 2013-10-02 | Paper |
Logic and computation in a lambda calculus with intersection and union types
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
The complexity of the certification of properties of stable marriage
Information Processing Letters | 2009-08-27 | Paper |
Specifying and Reasoning About Dynamic Access-Control Policies
Automated Reasoning | 2009-03-12 | Paper |
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
Theoretical Computer Science | 2008-06-24 | Paper |
Strong Normalization of the Dual Classical Sequent Calculus
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Normal forms for binary relations
Theoretical Computer Science | 2006-09-14 | Paper |
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science | 2006-08-28 | Paper |
Equality between functionals in the presence of coproducts
Information and Computation | 2003-01-14 | Paper |
Equational unification, word unification, and 2nd-order equational unification
Theoretical Computer Science | 1998-08-13 | Paper |
A combinatory logic approach to higher-order E-unification
Theoretical Computer Science | 1997-02-28 | Paper |
Closed categories and categorial grammar
Notre Dame Journal of Formal Logic | 1994-06-14 | Paper |
Higher-order unification via combinators
Theoretical Computer Science | 1993-09-02 | Paper |
Adding algebraic rewriting to the untyped lambda calculus
Information and Computation | 1993-05-16 | Paper |
An improved general \(E\)-unification method
Journal of Symbolic Computation | 1993-01-17 | Paper |
A strong Baire category theorem for products
Topology and its Applications | 1992-06-25 | Paper |
Decomposition theorems for measures
Journal of Mathematical Analysis and Applications | 1987-01-01 | Paper |
Decomposition of infinite matrices
Journal of Combinatorial Theory. Series A | 1987-01-01 | Paper |
Gentzen systems, resolution, and literal trees
Notre Dame Journal of Formal Logic | 1986-01-01 | Paper |
