Write your Own Virtual Machine
Write your Own Virtual Machine By: Justin Meiners and Ryan Pendleton View the final code and other resources in the GitHub repo. In this tutorial, I will teach you how to write your own virtual machine (VM) that can run assembly language programs, such as my friend’s 2048 or my Roguelike. If you know how to program, but would like to gain a deeper understanding of what is going on inside a compute
Implementing Type Systems as Macros
There’s a neat paper Type Systems as Macros by Chang, Knauth, and Greenman [1] that describes how to implement a typed language using an untyped host language and macro expansion. The paper is neat, but I found the code hard to follow—the paper uses a compact notation that’s convenient for print, but not so much for reproducing on one’s own. This post is my attempt to implement and explain in more
Programming languages resources
This page is a collection of my favorite resources for people getting started writing programming languages. I hope to keep it updated as long as I continue to find great stuff. I made a fun compilers t-shirt and also a fun JIT compilers t-shirt Compilers Tufts compilers course COMP/CS 181 (2006, but it’s been taught more recently. I should probably ping Sam.) Cornell compilers course CS 6120 and
Rigorous Nonsense - Implementing Brainfuck
APL is a pretty great language for quickly iterating on program architecture. In particular, here is a quick comparison of a couple brainfuck implementations. The brainfuck virtual machine is essentially a minimal Harvard architecture: we have an instruction space, a data tape, and indices into each. If you are unfamiliar with the (tiny!) specification, take a look at brainfuck’s official website.
Damas-Hindley-Milner inference two ways
What is Damas-Hindley-Milner? Damas-Hindley-Milner (HM) is a type system for Standard ML and the ML-family languages with parametric polymorphism, aka generic functions. It sits at a sweet spot in PL design: the type system is quite expressive, and there are well known type inference algorithms that require absolutely no annotations from the programmer. It seems to have been discovered independent
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
GitHub - kseo/poly_constraints: Hindley-Milner type inference using constraints
GitHub - tpetricek/teaching: :mortar_board: Materials for my lectures including programming langauge design, software engineering and human-computer interaction.
Write your own tiny programming system(s) Course | Lobsters
https://old.reddit.com/r/ProgrammingLanguages/comments/1huv4cf/so_youre_writing_a_programming_language
So you're writing a programming language | Lobsters
inkwell/examples/kaleidoscope at master · TheDan64/inkwell
LLVM Tutorial: Table of Contents — LLVM 22.0.0git documentation
GitHub - justinmeiners/lc3-vm: Write your own virtual machine for the LC-3 computer!
Write your Own Virtual Machine | Lobsters
Bitbucket
Implementing Type Systems as Macros | Lobsters
Implementing Brainfuck | Lobsters
Damas-Hindley-Milner inference two ways | Lobsters
GitHub - andrejbauer/plzoo: Programming Languages Zoo
GitHub - jarble/transpiler: A universal translator for programming languages