Interpreter (computing)

Known as: Interpreter (software), Interpreter (disambiguation), Code interpreter 
In computer science, an interpreter is a computer program that directly executes, i.e. performs, instructions written in a programming or scripting… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem. In… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Many different machine learning algorithms exist; taking into account each algorithm's hyperparameters, there is a staggeringly… (More)
  • table 2
  • table 1
  • figure 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We propose a natural scene statistic-based distortion-generic blind/no-reference (NR) image quality assessment (IQA) model that… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Software engineers are faced with a dilemma. They want to write general and wellstructured programs that are flexible and easy to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Nowadays, object-oriented meta-languages such as MOF (Meta-Object Facility) are increasingly used to specify domain-specific… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We exhibit a set of functions coded in Haskell that can be used as building blocks to construct a variety of interpreters for… (More)
  • figure 2
  • figure 7
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Incentive contracts often include important subjective components that mitigate incentive distortions caused by imperfect… (More)
  • figure I
  • figure II
  • figure III
  • figure IV
  • figure V
Is this relevant?
Highly Cited
1979
Highly Cited
1979
It is shown how by using results from combinatory logic an applicative language, such as LISP, can be translated into a form from… (More)
  • figure I
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1972
Highly Cited
1972
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by… (More)
Is this relevant?