A unification algorithm for typed \(\overline\lambda\)-calculus (Q1230505): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(75)90011-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2034676877
@@ Property / OpenAlex ID: W2034676877 / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution in type theory
@@ Property / cites work: Resolution in type theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5677084
@@ Property / cites work: Q5677084 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5686017
@@ Property / cites work: Q5686017 / rank @@
+Normal rank
@@ Property / cites work @@
+A unification algorithm for typed \(\overline\lambda\)-calculus
+Normal rank
@@ Property / cites work @@
+The undecidability of unification in third order logic
+Normal rank
@@ Property / cites work @@
+Mechanizing \(\omega\)-order type theory through unification
+Normal rank
@@ Property / cites work @@
+A Complete Mechanization of Second-Order Type Theory
+Normal rank
@@ Property / cites work @@
+Q5624683
@@ Property / cites work: Q5624683 / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Oriented Logic Based on the Resolution Principle
+Normal rank