A sequent calculus for type assignment (Q4147961): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2307/2272314
@@ Property / full work available at URL: https://doi.org/10.2307/2272314 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1974396457
@@ Property / OpenAlex ID: W1974396457 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547552
@@ Property / cites work: Q5547552 / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution in type theory
@@ Property / cites work: Resolution in type theory / rank @@
+Normal rank
@@ Property / cites work @@
+Intensional interpretations of functionals of finite type I
+Normal rank
@@ Property / cites work @@
+Combinators, \(\lambda\)-terms and proof theory
@@ Property / cites work: Combinators, \(\lambda\)-terms and proof theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5559220
@@ Property / cites work: Q5559220 / rank @@
+Normal rank
@@ Property / cites work @@
+Functionals defined by recursion
@@ Property / cites work: Functionals defined by recursion / rank @@
+Normal rank
@@ Property / cites work @@
+ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
+Normal rank
@@ Property / cites work @@
+Combinatory logic. Vol. II
@@ Property / cites work: Combinatory logic. Vol. II / rank @@
+Normal rank