An arithmetic for non-size-increasing polynomial-time computation (Q1827388): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2003.10.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2051832719
@@ Property / OpenAlex ID: W2051832719 / rank @@
+Normal rank
@@ Property / cites work @@
+A syntactical analysis of non-size-increasing polynomial time computation
+Normal rank
@@ Property / cites work @@
+Higher type recursion, ramification and polynomial time
+Normal rank
@@ Property / cites work @@
+Q4281467
@@ Property / cites work: Q4281467 / rank @@
+Normal rank
@@ Property / cites work @@
+ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
+Normal rank
@@ Property / cites work @@
+Q2712583
@@ Property / cites work: Q2712583 / 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 @@
+Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
+Normal rank
@@ Property / cites work @@
+Intrinsic reasoning about functional programs. I: First order theories
+Normal rank
@@ Property / cites work @@
+Q3127078
@@ Property / cites work: Q3127078 / rank @@
+Normal rank