Explore combinatory logic, combinator birds, and tacit programming across different languages like BQN, J, APL, and Haskell.
Finite-Choice Logic Programming | Proceedings of the ACM on Programming Languages
Logic programming, as exemplified by datalog, defines the meaning of a program as its unique smallest model: the deductive closure of its inference rules. However, many problems call for an enumeration of models that vary along some set of choices while ...
Combinators: A Centennial View
100 years after combinators were first presented, Stephen Wolfram shows how his computational paradigm moves closer to the idea of combinators through a series of examples and with an eye to the future.
Turing: Probabalistic Programming in Julia | Cameron Pfiffer | JuliaCon 2019
Introduction to Higher-Order Categorical Logic (Cambridge Studies in Advanced Mathematics)
Introduction to higher order catagorical logic by J. Lambek, March 25, 1988, Cambridge University Press edition, Paperback in English
Aaron Steven White
computational semanticist. into modular synths and tiki. https://aaronstevenwhite.io
"Concatenative programming and stack-based languages" by Douglas Creager
J Notation as a Tool of Thought
Kenneth Iverson’s 1964 language, APL, won him the Turing Award. His award lecture, Notation as a Tool of Thought, argued that better notations would lead people to deeper insights about mathematics. He provided a number of examples ranging across linear algebra, arithmetic, probability, and logic. Unfortunately, most of the mathematics he covers isn’t relevant to programming. However, his core idea still applies, and changing how we describe programs changes how we think about them.
The Next 7000 Programming Languages
Landin’s seminal paper “The next 700 programming languages” considered programming languages prior to 1966 and speculated on the next 700. Half-a-century on, we cast programming languages in a Darwinian ‘tree of life’ and explore languages, their features (genes) and language evolution from the viewpoint of ‘survival of the fittest’.
Resugaring | Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
Syntactic sugar plays a crucial role in engineering programming languages. It offers convenient syntax and higher-level of abstractions, as witnessed by its pervasive use in both general-purpose and domain-specific contexts. Unfortunately, the ...
A theory of type polymorphism in programming
The aim of this work is largely a practical one. A widely employed style of programming, particularly in structure-processing languages which impose n…
R for cats · and cat lovers
This is an introduction to R. I promise this will be fun. Since you have never used a programming language before, or any language for that matter, you won’t be tainted by other programming languages with different ways of doing things. This is good - we can teach you the R way of doing things.
Aaron Steven White
computational semanticist. into modular synths and rum. https://aaronstevenwhite.io