Existential Type Systems with No Types in Terms (Q3637189): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02273-9_10
+Normal rank
@@ Property / OpenAlex ID @@
+W1576139432
@@ Property / OpenAlex ID: W1576139432 / rank @@
+Normal rank
@@ Property / cites work @@
+A normalization-procedure for the first order classical natural deduction with full logical symbols
+Normal rank
@@ Property / cites work @@
+Constructive proofs of the range property in lambda calculus
+Normal rank
@@ Property / cites work @@
+Domain-free pure type systems
@@ Property / cites work: Domain-free pure type systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536445
@@ Property / cites work: Q4536445 / rank @@
+Normal rank
@@ Property / cites work @@
+CPS-translation as adjoint
@@ Property / cites work: CPS-translation as adjoint / rank @@
+Normal rank
@@ Property / cites work @@
+Typed Lambda Calculi and Applications
@@ Property / cites work: Typed Lambda Calculi and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of the semi-unification problem
+Normal rank
@@ Property / cites work @@
+Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
+Normal rank
@@ Property / cites work @@
+Q3142167
@@ Property / cites work: Q3142167 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5559220
@@ Property / cites work: Q5559220 / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on the Curry-Howard isomorphism
@@ Property / cites work: Lectures on the Curry-Howard isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Typability and type checking in System F are equivalent and undecidable
+Normal rank