Taming Modal Impredicativity: Superlazy Reduction (Q3605525): Difference between revisions

@@ Property / arXiv ID @@
+.2891
@@ Property / arXiv ID: 0810.2891 / rank @@
+Normal rank
@@ Property / cites work @@
+Taming Modal Impredicativity: Superlazy Reduction
@@ Property / cites work: Taming Modal Impredicativity: Superlazy Reduction / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded linear logic: A modular approach to polynomial-time computability
+Normal rank
@@ Property / cites work @@
+Light linear logic
@@ Property / cites work: Light linear logic / rank @@
+Normal rank
@@ Property / cites work @@
+Soft linear logic and polynomial time
@@ Property / cites work: Soft linear logic and polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
+Normal rank
@@ Property / cites work @@
+Stratified polymorphism and primitive recursion
@@ Property / cites work: Stratified polymorphism and primitive recursion / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of alternating log time by ramified recurrence
+Normal rank
@@ Property / cites work @@
+Head linear reduction and pure proof net extraction
+Normal rank
@@ Property / cites work @@
+Tiering as a Recursion Technique
@@ Property / cites work: Tiering as a Recursion Technique / rank @@
+Normal rank