Linear types and non-size-increasing polynomial time computation. (Q1401943): Difference between revisions

@@ Property / cites work @@
+A syntactical analysis of non-size-increasing polynomial time computation
+Normal rank
@@ Property / cites work @@
+A new recursion-theoretic characterization of the polytime functions
+Normal rank
@@ Property / cites work @@
+Light linear logic
@@ Property / cites work: Light linear logic / rank @@
+Normal rank
@@ Property / cites work @@
+Safe recursion with higher types and BCK-algebra
@@ Property / cites work: Safe recursion with higher types and BCK-algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4518880
@@ Property / cites work: Q4518880 / rank @@
+Normal rank
@@ Property / cites work @@
+The strength of non-size increasing computation
@@ Property / cites work: The strength of non-size increasing computation / rank @@
+Normal rank
@@ Property / cites work @@
+Region-based memory management
@@ Property / cites work: Region-based memory management / rank @@
+Normal rank
@@ Property / cites work @@
+Static prediction of heap space usage for first-order functional programs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0890-5401(03)00009-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2010059824
@@ Property / OpenAlex ID: W2010059824 / rank @@
+Normal rank