| Publication | Date of Publication | Type |
|---|
| Strong nominal semantics for fixed-point constraints | 2026-04-02 | Paper |
| The Ackermann award 2023 | 2026-02-19 | Paper |
| Equational reasoning modulo commutativity in languages with binders | 2026-01-21 | Paper |
A nominal approach to equational problems in languages with binders
ACM Transactions on Computational Logic | 2026-01-07 | Paper |
| Nominal equational rewriting and narrowing | 2025-09-03 | Paper |
| Closed nominal rewriting and efficiently computable nominal algebra equality | 2025-08-19 | Paper |
| A certified algorithm for AC-unification | 2024-05-27 | Paper |
Nominal AC-matching
Lecture Notes in Computer Science | 2024-02-28 | Paper |
Interaction nets and term rewriting systems (extended abstract)
Trees in Algebra and Programming — CAAP '96 | 2023-02-23 | Paper |
(Head-)normalization of typeable rewrite systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
AC complement problems: Satisfiability and negation elimination
Rewriting Techniques and Applications | 2022-12-09 | Paper |
A port graph rewriting approach to relational database modelling
Logic-Based Program Synthesis and Transformation | 2022-08-25 | Paper |
A certified functional nominal C-unification algorithm
Logic-Based Program Synthesis and Transformation | 2022-08-25 | Paper |
Negation elimination in equational formulae (extended abstract)
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Formalising nominal C-unification generalised with protected variables
Mathematical Structures in Computer Science | 2022-01-20 | Paper |
| Nominal equational problems | 2021-10-18 | Paper |
| A strategic graph rewriting model of rational negligence in financial markets | 2021-08-30 | Paper |
| General dynamic recovery for compensating CSP | 2021-06-22 | Paper |
General dynamic recovery for compensating CSP
(available as arXiv preprint) | 2021-06-22 | Paper |
| Fixed-point constraints for nominal equational unification | 2021-06-15 | Paper |
| Elementary deduction problem for locally stable theories with normal forms | 2021-06-08 | Paper |
Elementary deduction problem for locally stable theories with normal forms
(available as arXiv preprint) | 2021-06-08 | Paper |
| scientific article; zbMATH DE number 7340567 (Why is no real title available?) | 2021-04-27 | Paper |
scientific article; zbMATH DE number 7340567 (Why is no real title available?)
(available as arXiv preprint) | 2021-04-27 | Paper |
Nominal syntax with atom substitutions
Journal of Computer and System Sciences | 2021-04-14 | Paper |
| PORGY: strategy-driven interactive transformation of graphs | 2021-03-03 | Paper |
PORGY: strategy-driven interactive transformation of graphs
(available as arXiv preprint) | 2021-03-03 | Paper |
| A new graphical calculus of proofs | 2021-03-03 | Paper |
A new graphical calculus of proofs
(available as arXiv preprint) | 2021-03-03 | Paper |
\texttt{EVL}: a typed higher-order functional language for events
(available as arXiv preprint) | 2021-02-22 | Paper |
| Labelled \(\lambda\)-calculi with explicit copy and erase | 2021-02-09 | Paper |
| On solving nominal disunification constraints | 2021-01-19 | Paper |
On nominal syntax and permutation fixed points
(available as arXiv preprint) | 2020-02-17 | Paper |
| Nominal syntax with atom substitutions: matching, unification, rewriting | 2020-01-30 | Paper |
| A formalisation of nominal C-matching through unification with protected variables | 2019-11-13 | Paper |
| Labelled port graph -- a formal structure for models and computations | 2019-11-12 | Paper |
A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
Theoretical Computer Science | 2019-06-25 | Paper |
Modularity of termination and confluence in combinations of rewrite systems with \(\lambda_\omega\)
Automata, Languages and Programming | 2019-03-29 | Paper |
Strategic port graph rewriting: an interactive modelling framework
Mathematical Structures in Computer Science | 2019-03-21 | Paper |
Approximation and normalization results for typeable term rewriting systems
Higher-Order Algebra, Logic, and Term Rewriting | 2019-01-11 | Paper |
Nominal C-unification
(available as arXiv preprint) | 2018-09-06 | Paper |
Nominal essential intersection types
Theoretical Computer Science | 2018-06-18 | Paper |
| Checking overlaps of nominal rewriting rules | 2018-04-23 | Paper |
| Completeness in PVS of a nominal unification algorithm | 2018-04-23 | Paper |
| Alpha-structural induction and recursion for the lambda calculus in constructive type theory | 2018-04-23 | Paper |
| A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols | 2018-04-23 | Paper |
Labelled graph strategic rewriting for social networks
Journal of Logical and Algebraic Methods in Programming | 2018-04-06 | Paper |
Typed nominal rewriting
ACM Transactions on Computational Logic | 2018-03-22 | Paper |
Intruder deduction problem for locally stable theories with normal forms and inverses
Theoretical Computer Science | 2018-02-09 | Paper |
| On solving nominal fixpoint equations | 2018-01-04 | Paper |
| Nominal narrowing | 2017-10-17 | Paper |
| Dependent types for nominal terms with atom substitutions | 2017-07-12 | Paper |
A graph-based framework for the analysis of access control policies
Theoretical Computer Science | 2017-06-15 | Paper |
Labelled graph rewriting meets social networks
Rewriting Logic and Its Applications | 2016-10-21 | Paper |
| Enabling synchronous and asynchronous communications in CSP for SOC | 2016-08-01 | Paper |
| A framework for the analysis of access control policies with emergency management | 2016-08-01 | Paper |
A typed language for events
Logic-Based Program Synthesis and Transformation | 2016-02-05 | Paper |
From nominal to higher-order rewriting and back again
Logical Methods in Computer Science | 2016-01-07 | Paper |
Access control and obligations in the category-based metamodel: a rewrite-based semantics
Logic-Based Program Synthesis and Transformation | 2015-10-02 | Paper |
Visual modelling of complex systems: towards an abstract machine for PORGY
Language, Life, Limits | 2015-02-25 | Paper |
Linearity: a roadmap
Journal Of Logic And Computation | 2015-01-12 | Paper |
Labelled calculi of resources
Journal Of Logic And Computation | 2015-01-12 | Paper |
A metamodel of access control for distributed environments: applications and properties
Information and Computation | 2014-10-20 | Paper |
Relating nominal and higher-order rewriting
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Programming languages and operational semantics. A concise overview
Undergraduate Topics in Computer Science | 2014-09-05 | Paper |
New developments in environment machines
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
Implementing nominal unification
Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
From functional programs to interaction nets via the rewriting calculus
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
The power of closed reduction strategies
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
| Interaction nets vs. the \(\rho\)-calculus: introducing bigraphical nets | 2013-10-07 | Paper |
| A higher-order calculus for graph transformation | 2013-08-27 | Paper |
Interaction nets with McCarthy's \(\mathsf{amb}\)
Electronic Notes in Theoretical Computer Science | 2013-08-15 | Paper |
A strategy language for graph rewriting
Logic-Based Program Synthesis and Transformation | 2013-03-13 | Paper |
Nominal completion for rewrite systems with binders
Automata, Languages, and Programming | 2012-11-01 | Paper |
Linearity and iterator types for Gödel's system \(\mathcal T\)
Higher-Order and Symbolic Computation | 2012-01-13 | Paper |
Principal types for nominal theories
Fundamentals of Computation Theory | 2011-08-19 | Paper |
The First-Order Nominal Link
Logic-Based Program Synthesis and Transformation | 2011-05-27 | Paper |
An operational approach to program extraction in the calculus of constructions
Logic Based Program Synthesis and Transformation | 2011-03-04 | Paper |
Matching and alpha-equivalence check for nominal terms
Journal of Computer and System Sciences | 2010-07-08 | Paper |
| Programming languages and operational semantics. An introduction. | 2010-06-30 | Paper |
Gödel's system \(\mathcal T\) revisited
Theoretical Computer Science | 2010-03-29 | Paper |
Models of computation. An introduction to computability theory
Undergraduate Topics in Computer Science | 2009-03-20 | Paper |
The Power of Linear Functions
Computer Science Logic | 2009-03-12 | Paper |
Curry-Style Types for Nominal Terms
Lecture Notes in Computer Science | 2009-03-10 | Paper |
Linear Recursive Functions
Rewriting, Computation and Proof | 2009-03-06 | Paper |
A polynomial nominal unification algorithm
Theoretical Computer Science | 2008-09-16 | Paper |
Nominal Matching and Alpha-Equivalence
Logic, Language, Information and Computation | 2008-07-10 | Paper |
Iterator Types
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Nominal rewriting
Information and Computation | 2007-07-16 | Paper |
Lambda-calculus with director strings
Applicable Algebra in Engineering, Communication and Computing | 2005-06-16 | Paper |
Closed reduction: explicit substitutions without $\alpha$ -conversion
Mathematical Structures in Computer Science | 2005-05-06 | Paper |
| scientific article; zbMATH DE number 2059570 (Why is no real title available?) | 2004-03-17 | Paper |
| scientific article; zbMATH DE number 2043520 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 2016068 (Why is no real title available?) | 2003-12-10 | Paper |
Operational equivalence for interaction nets.
Theoretical Computer Science | 2003-08-17 | Paper |
Normalization, approximation, and semantics for combinator systems
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1696608 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1512711 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1487844 (Why is no real title available?) | 2000-08-10 | Paper |
Type assignment and termination of interaction nets
Mathematical Structures in Computer Science | 1999-03-22 | Paper |
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming | 1999-03-16 | Paper |
Negation elimination in empty or permutative theories
Journal of Symbolic Computation | 1999-01-19 | Paper |
| scientific article; zbMATH DE number 1424037 (Why is no real title available?) | 1999-01-01 | Paper |
Interaction nets and term-rewriting systems
Theoretical Computer Science | 1998-06-30 | Paper |
Normalization results for typeable rewrite systems
Information and Computation | 1997-06-16 | Paper |
AC complement problems: Satisfiability and negation elimination
Journal of Symbolic Computation | 1997-03-23 | Paper |
Intersection type assignment systems with higher-order algebraic rewriting
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 512772 (Why is no real title available?) | 1994-03-10 | Paper |
Narrowing based procedures for equational disunification
Applicable Algebra in Engineering, Communication and Computing | 1993-01-16 | Paper |
