Finitary PCF is not decidable (Q5958762): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4490717
@@ Property / cites work: Q4490717 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4222822
@@ Property / cites work: Q4222822 / rank @@
+Normal rank
@@ Property / cites work @@
+Polymorphic rewriting conserves algebraic confluence
+Normal rank
@@ Property / cites work @@
+On full abstraction for PCF: I, II and III
@@ Property / cites work: On full abstraction for PCF: I, II and III / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281476
@@ Property / cites work: Q4281476 / rank @@
+Normal rank
@@ Property / cites work @@
+Unary PCF is decidable
@@ Property / cites work: Unary PCF is decidable / rank @@
+Normal rank
@@ Property / cites work @@
+Fully abstract models of typed \(\lambda\)-calculi
+Normal rank
@@ Property / cites work @@
+Kripke logical relations and PCF
@@ Property / cites work: Kripke logical relations and PCF / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of all minimal models
@@ Property / cites work: Decidability of all minimal models / rank @@
+Normal rank
@@ Property / cites work @@
+LCF considered as a programming language
@@ Property / cites work: LCF considered as a programming language / rank @@
+Normal rank
@@ Property / cites work @@
+Q4490721
@@ Property / cites work: Q4490721 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138547
@@ Property / cites work: Q3138547 / rank @@
+Normal rank
@@ Property / cites work @@
+Logical relations and the typed λ-calculus
@@ Property / cites work: Logical relations and the typed λ-calculus / rank @@
+Normal rank