Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060): Difference between revisions

@@ Property / cites work @@
+Q4281490
@@ Property / cites work: Q4281490 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3342534
@@ Property / cites work: Q3342534 / rank @@
+Normal rank
@@ Property / cites work @@
+The calculus of constructions
@@ Property / cites work: The calculus of constructions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5667469
@@ Property / cites work: Q5667469 / rank @@
+Normal rank
@@ Property / cites work @@
+A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
+Normal rank
@@ Property / cites work @@
+Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
+Normal rank
@@ Property / cites work @@
+Simulating expansions without expansions
@@ Property / cites work: Simulating expansions without expansions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5580926
@@ Property / cites work: Q5580926 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994895
@@ Property / cites work: Q3994895 / rank @@
+Normal rank
@@ Property / cites work @@
+Formal category theory: Adjointness for 2-categories
+Normal rank
@@ Property / cites work @@
+The virtues of eta-expansion
@@ Property / cites work: The virtues of eta-expansion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3815296
@@ Property / cites work: Q3815296 / rank @@
+Normal rank