A characterization of lambda-terms transforming numerals (Q5371970): Difference between revisions

@@ Property / cites work @@
+Q3077958
@@ Property / cites work: Q3077958 / rank @@
+Normal rank
@@ Property / cites work @@
+Böhm trees as higher-order recursion schemes
@@ Property / cites work: Böhm trees as higher-order recursion schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Cost Functions, Part I: Logic and Algebra over Words
+Normal rank
@@ Property / cites work @@
+Pumping by Typing
@@ Property / cites work: Pumping by Typing / rank @@
+Normal rank
@@ Property / cites work @@
+On the Significance of the Collapse Operation
@@ Property / cites work: On the Significance of the Collapse Operation / rank @@
+Normal rank
@@ Property / cites work @@
+How Many Numbers Can a Lambda-Term Contain?
@@ Property / cites work: How Many Numbers Can a Lambda-Term Contain? / rank @@
+Normal rank
@@ Property / cites work @@
+Definierbare Funktionen imλ-Kalkül mit Typen
@@ Property / cites work: Definierbare Funktionen imλ-Kalkül mit Typen / rank @@
+Normal rank
@@ Property / cites work @@
+The typed lambda-calculus is not elementary recursive
+Normal rank
@@ Property / cites work @@
+Word operation definable in the typed \(\lambda\)-calculus
+Normal rank