This position paper proposes the exploitation of type feedback mechanisms, or more precisely, polymorphic inline caches, for purely interpreting implementations of object-oriented programming languages. Using Squeak’s virtual machine as an example, polymorphic inline caches are discussed as an alternative to global caching. An implementation proposal for polymorphic inline caches in the Squeak ...

THE INTERPRETIVE THEORY OF DANICA SELESKOVITCH TWENTY YEARS AFTER: QUESTION DIRECTIONALITY IN CONFERENCE INTERPRETINGThe aim of the present paper is to examine directionality in conference interpreting and changing concepts active passive languages practice Poland. The study presents results a small-scale survey conducted Warsaw Winter 2019/2020 among interpreters, members national professional...

An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years. This paper is an attempt at finding a closed-form formula for the number of S-restricted compositions of n. To do so, we reduce the problem to...

The problem of typing polymorphic recursion (i.e., recursive function definitions rec {x = e} where different occurrences of x in e are used with different types) has been investigated both by people working on type systems and by people working on abstract interpretation. Recently, Gori and Levi have developed a family of abstract interpreters that are able to type all the ML typable recursive...

The dominant approach to model-driven development and domain-specific language engineering is to write a translator, or compiler, that defines a strategy for executing the high-level language. In this paper we introduce a new approach to strategic programming by writing interpreters of high-level modeling languages, rather than compilers. This technique is demonstrated by interpreting data mode...

Meta-level compositions of object logic programs are naturally implemented by means of meta-programming techniques. Meta-interpreters deening program compositions however suuer from a computational overhead that is due partly to the interpretation layer present in all meta-programs, and partly to the speciic interpretation layer needed to deal with program compositions. We show that meta-interp...

Interpreters designed for efficiency execute a huge number of indirect branches and can spend more than half of the execution time in indirect branch mispredictions. Branch target buffers are the best widely available form of indirect branch prediction; they produce 50%–100% mispredictions for existing interpreters. In this paper we investigate three methods for improving the prediction accurac...

Compared to imperative programming languages like Pascal or Basic, or functional programming languages like ML or Haskell learning Java is hampered by the fact that to get even the simplest running program the learner has to define a public class and a method with a certain signature. We present both a stand-alone and a webbased interpreter which execute Java fragments and relieve the learner f...

BACKGROUND Patients with limited English proficiency (LEP) represent a growing proportion of the US population and are at risk of receiving suboptimal care due to difficulty communicating with healthcare providers who do not speak their language. Medical school curricula are required to prepare students to care for all patients, including those with LEP, but little is known about how well they ...

In this paper, we compose six different Python and Prolog VMs into 4 pairwise compositions: one using C interpreters; one running on the JVM; one using meta-tracing interpreters; and one using a C interpreter and a meta-tracing interpreter. We show that programs that cross the language barrier frequently execute faster in a meta-tracing composition, and that meta-tracing imposes a significantly...