Strong Normalization of Proof Nets Modulo Structural Congruences
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Quadratic Correctness Criterion for Non-commutative Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Dominator Trees and Fast Verification of Proof Nets
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Fast verification of MLL proof nets via IMLL
ACM Transactions on Computational Logic (TOCL)
Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewritings for Polarized Multiplicative and Exponential Proof Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof-search in implicative linear logic as a matching problem
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A linear algorithm for MLL proof net correctness and sequentialization
Theoretical Computer Science
Correctness of linear logic proof structures is NL-complete
Theoretical Computer Science
Correctness of multiplicative (and exponential) proof structures is NL-complete
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set union-find at the core of the unification criterion is a special case of union-find with a real linear time solution.