HackerPapers

arXiv:cs/0311032cs.PL

A Very Short Self-Interpreter

Oleg Mazonka, Daniel B. Cristofani

Abstract

In this paper we would like to present a very short (possibly the shortest) self-interpreter, based on a simplistic Turing-complete imperative language. This interpreter explicitly processes the statements of the language, which means the interpreter constitutes a description of the language inside that same language. The paper does not require any specific knowledge; however, experience in programming and a vivid imagination are beneficial.

arXiv comments
Journal reference
DOI
Subjects
cs.PLProgramming Languages

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from May 2020 to Feb 2022.

Comments linking this paper, per year.

Discussed in comments2 threads

  1. N64 WASM 1 comment

    • You are correct, this is what I meant. I've found "self-interpreter" implementations that aim to be short https://arxiv.org/html/cs/0311032 https://codegolf.stackexchange.com/questions/585/self-interp... But I haven't found anyone yet that optimized for actual number of…

      mdonahoeView on HNParent context

  2. “Maxwell's equations of software” examined (2008) 1 comment

    • It takes 829 bits of binary lambda calculus to interpret BrainFuck, which is very simple programming language modeled after Turing Machines. A self-interpreter in BrainFuck takes well over a thousand bits though [2]. Lambda calculus is not only very simple, but also very…

      trompView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.