Creează un cont pentru a te abona la acest blog și a-i urmări articolele pe pagina Lectură.
-
A Nearly Perfect Solution to the Expression Problem in typed JavaScript, Found in the Wild
This blog is built using unifiedjs, an ecosystem of packages built around universal representation of syntax trees and processors.
-
A Tale of Three Constructed Languages
Today, we’re gonna talk about conlangs!
-
An Introduction to Session Types
Session types.
-
Neural Networks with Cube Cats
Neural Networks.
-
Paper Girls, Substitution Ciphers, and Frequency Analysis
WARNING!
-
VISL CG-3 is the new assembler
This post is a continuation of Constraint Grammar can count!
-
Presidents, Scumbags, Kings and Arseholes, and The Great Dalmuti
One of my favourite card games is The Great Dalmuti.
-
Breadboxes, Plenty Questions and Distributional Semantics
Quite a while ago, UnicornPower introduced me to a game called Breadbox.
-
One λ-calculus, many times…
Previously, I mentioned that one of the most common posts on Agda blogs is implementing the simply-typed λ-calculus.
-
Constraint Grammar can count!
Constraint grammar—it is a natural language processing formalism with great two distinctions: it routinely scores amongst the highest in tasks such as part-of-speech tagging and word-sense disambiguation, with F-scores at around 99%; and it has made some…
-
Side-effects in English
Back when I wrote this, I had just discovered “Extensible Effects: an alternative to Monad Transformers” by Oleg Kiselyov, Amr Sabry, Cameron Swords, and Hiromi Ishii, and I’ve always had a penchant for mucking about with linguistics and Haskell… so… let’s
-
Insertion sort in Agda
I wrote this code a long time ago, and verifiying the correctness of some sorting algorithm is pretty much the standard “Hello World!