A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language (Q3011126): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2178/jsl/1305810770
+Normal rank
@@ Property / OpenAlex ID @@
+W2022792384
@@ Property / OpenAlex ID: W2022792384 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133603
@@ Property / cites work: Q4133603 / rank @@
+Normal rank
@@ Property / cites work @@
+Order-incompleteness and finite lambda reduction models
+Normal rank
@@ Property / cites work @@
+The Logic of Bunched Implications
@@ Property / cites work: The Logic of Bunched Implications / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform proofs as a foundation for logic programming
+Normal rank
@@ Property / cites work @@
+A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
+Normal rank
@@ Property / cites work @@
+Q3817651
@@ Property / cites work: Q3817651 / rank @@
+Normal rank
@@ Property / cites work @@
+What is Logic?
@@ Property / cites work: What is Logic? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3522248
@@ Property / cites work: Q3522248 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
+Normal rank

A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126): Difference between revisions