Six month retrospective on thinking small. I describe work optimizing GHC backend like LLVM, conversion of Paul Tarau’s bijective Godel numbering to term algebras in regular shape polymorphic parallel arrays library. I note Vladimir Veovodsky’s interest in Martin-Lof Type theory. And Agda as a potential target implementation for univalent foundations in mathematics.
Archive for the ‘lambda calculus’ Category
Luckily a year ago I made a good choice in programming languages: Haskell. Language trends are harder to read. Think there’s a practical use for Second order Lambda Calculus with Polymorphism? I do. Category theory is embedded in the core libraries of the language which makes incorporating information flow and the logical environment of the Information Flow Framework a natural fit.
The central topic for this post is to sketch out a program for developing a new theory of meaning. In short, my hypothesis is this: a) semantics provides a theory of representation and truth; b) semiotics provides a theory signs and their interpretation; c) pragmaticism defines the effect of a conception on other objects as the whole of the conception; and d) meaning emerges in a complex system through the convergence of relational properties and domain knowledge.