… reversibility. We provide a program inverter for the language and implement a self-interpreter that achieves deterministic forward and backward interpretation of Janus programs without using a computation history. As the self-interpreter …
PEPM 2007: 144-153 [doi]… on the inputs and outputs of a well-typed self-interpreter. We propose a technical … optimal” results when a self-interpreter is specialized to a typeincorrect …
saig 2000: 129-148 [doi]… simplifications and a high-level, higher-order, typed self-applicable interpreter …
pado 2001: 257-275 [doi]… of Copenhagen. The goal is automatically to generate compilers from interpreters by self … time in the interpreter itself. In the end some conclusions and issues are proposed. …This article describes SCHISM: a self-applicable partial evaluator for a first …
ESOP 1988: 236-246… interpreters, the theoretical possibility of bootstrapping powerful specializers … an entire level of self-interpretation. This paper argues that Jones optimality, which was originally devised as a criterion for self-applicable specializers …
lisp, 21(3), 2008. [doi]… by inserting an interpreter between a subject program and a specializer. We formulate … interpreters. The goal is to provide a new way to control the specialization … the automatic production of specializers. Using an existing, self-applicable partial …
iccl 1994: 183-194… is higher order, interpreters written in a higher order style can be partially … of an interpreter for a lambda calculus language: one written in direct style, one written … implementing call-by-need reduction. The three latter interpreters are heavily …
SCP, 17(1-3):3-34, 1991.… of compilers from interpreters, the specializer projections define the generation of specializers from interpreters. We discuss the potential applications …Self-applicable specializers have been used successfully to automate …
JFP, 4(4):499-514, 1994. [doi]