A Very Short Self-Interpreter

Simple item page
dc.creatorMazonka, Oleg
dc.creatorCristofani, Daniel B.
dc.date2003-11-21
dc.date.accessioned2026-07-07T03:20:36Z
dc.date.available2026-07-07T03:20:36Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0311032
dc.identifierhttp://arxiv.org/abs/cs/0311032
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31884
dc.subjectProgramming Languages
dc.subjectD.3
dc.titleA Very Short Self-Interpreter
dc.typetext

Files

Collections

arXiv