Upper bounds for standardizations and an application (Q4254636): Difference between revisions

@@ Property / cites work @@
+Parallel reductions in \(\lambda\)-calculus
@@ Property / cites work: Parallel reductions in \(\lambda\)-calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution in type theory
@@ Property / cites work: Resolution in type theory / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinal analysis of terms of finite type
@@ Property / cites work: Ordinal analysis of terms of finite type / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994895
@@ Property / cites work: Q3994895 / rank @@
+Normal rank
@@ Property / cites work @@
+The typed lambda-calculus is not elementary recursive
+Normal rank
@@ Property / cites work @@
+An upper bound for reduction sequences in the typed \(\lambda\)-calculus
+Normal rank
@@ Property / cites work @@
+The Standardization Theorem for λ‐Calculus
@@ Property / cites work: The Standardization Theorem for λ‐Calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Residual theory in λ-calculus: a formal development
+Normal rank
@@ Property / cites work @@
+The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty  $-Models of the Lambda-Calculus
+Normal rank