A formal model for a linear time correctness condition of proof nets of multiplicative linear logic (Q2119124): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-68446-4_16
+Normal rank
@@ Property / OpenAlex ID @@
+W3129864002
@@ Property / OpenAlex ID: W3129864002 / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-persistent Data Structures
@@ Property / cites work: Semi-persistent Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of multiplicatives
@@ Property / cites work: The structure of multiplicatives / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Linear logic
@@ Property / cites work: Linear logic / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for MLL proof net correctness and sequentialization
+Normal rank
@@ Property / cites work @@
+An Efficient Unification Algorithm
@@ Property / cites work: An Efficient Unification Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic
+Normal rank
@@ Property / cites work @@
+Fast verification of MLL proof nets via IMLL
@@ Property / cites work: Fast verification of MLL proof nets via IMLL / rank @@
+Normal rank
@@ Property / cites work @@
+Correctness of linear logic proof structures is NL-complete
+Normal rank
@@ Property / cites work @@
+Q4140378
@@ Property / cites work: Q4140378 / rank @@
+Normal rank