Edit: Concatenative language/Publications

Academic papers about about [[Concatenative language|Concatenative languages]]: - [[https://doi.org/10.5753/sblp.2024.3460|Converting Combinatory Logic to and from Concatenative Calculus]] - Daniel K Hashimoto and Hugo Musso, 2024. - Arnold, Z.L. & Perugini, S. (2019). [[https://dl.acm.org/doi/abs/10.5555/3381613.3381621|An introduction to concatenative programming in Factor]]. Journal of Computing Sciences in Colleges, 35(5),70-77. USA: Consortium for Computing Sciences in Colleges. (Available in ACM Digital Library at [[https://dl.acm.org/doi/abs/10.5555/3381613.3381621]].) - [[https://www2.ccs.neu.edu/racket/pubs/dissertation-kleffner.pdf|A Foundation for Typed Concatenative Languages]] - Robert Kleffner, 2017. - [[http://factorcode.org/littledan/dls.pdf|Factor: a dynamic stack-based programming language]] - Slava Pestov, Daniel Ehrenberg, Joe Groff, 2010. [[http://www.dynamic-languages-symposium.org/dls-10/|DLS2010]] - [[http://mitarbeiter.hs-heilbronn.de/~herzberg/Publications/ICSOFT.2009.pdf|Concatenative Programming: An Overlooked Paradigm in Functional Programming]] - Dominikus Herzberg, Tim Reichert, 2009. - [[http://www.cat-language.com/Cat-TR-2008-001.pdf|Simple Type Inference for Higher-Order Stack-Oriented Languages]] - Christopher Diggins, 2008. - [[https://tunes.org/~iepos/joy.html|The Theory of Concatenative Combinators]] - Brent Kerby, 2007. - [[https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3E99993FE5464986AD94D292FF5EA275/S0956796802004483a.pdf/theoretical-pearls-flattening-combinators-surviving-without-parentheses.pdf|Theoretical Pearls, Flattening Combinators: Surviving Without Parentheses]] - Chris Okasaki, 2003. - [[http://www.complang.tuwien.ac.at/anton/euroforth/ef01/thomas01a.pdf|Joy: Forth's Functional Cousin]] - Manfred von Thun, 2001. - [[https://archive.org/details/the-road-towards-a-minimal-forth-architecture|The Road Towards a Minimal Forth Architecture]] - Mikael Patel, 1990.

Describe this revision:

Save