aboutsummaryrefslogtreecommitdiffhomepage
path: root/readme.md
diff options
context:
space:
mode:
Diffstat (limited to 'readme.md')
-rw-r--r--readme.md21
1 files changed, 21 insertions, 0 deletions
diff --git a/readme.md b/readme.md
index a456752..01d9d7e 100644
--- a/readme.md
+++ b/readme.md
@@ -33,3 +33,24 @@ Wiki, docs, articles, examples and more:
Learn anything about bruijn in the
[wiki](https://bruijn.marvinborner.de/wiki/) (also found in
`docs/wiki_src/`).
+
+## References
+
+0. De Bruijn, Nicolaas Govert. “Lambda calculus notation with nameless
+ dummies, a tool for automatic formula manipulation, with application
+ to the Church-Rosser theorem.” Indagationes Mathematicae
+ (Proceedings). Vol. 75. No. 5. North-Holland, 1972.
+1. Mogensen, Torben. “An investigation of compact and efficient number
+ representations in the pure lambda calculus.” International Andrei
+ Ershov Memorial Conference on Perspectives of System Informatics.
+ Springer, Berlin, Heidelberg, 2001.
+2. Wadsworth, Christopher. “Some unusual λ-calculus numeral systems.”
+ (1980): 215-230.
+3. Tromp, John. “Binary lambda calculus and combinatory logic.”
+ Randomness and Complexity, from Leibniz to Chaitin. 2007. 237-260.
+4. Tromp, John. “Functional Bits: Lambda Calculus based Algorithmic
+ Information Theory.” (2022).
+5. Biernacka, M., Charatonik, W., & Drab, T. (2022). A simple and
+ efficient implementation of strong call by need by an abstract
+ machine. Proceedings of the ACM on Programming Languages, 6(ICFP),
+ 109-136.