Definitional Interpreters Revisited
نویسنده
چکیده
To introduce the republication of “Definitional Interpreters for Higher-Order Programming Languages”, the author recounts the circumstances of its creation, clarifies several obscurities, corrects a few mistakes, and briefly summarizes some more recent developments.
منابع مشابه
Engineering Definitional Interpreters ( Extended Version )
A definitional interpreter should be clear and easy to write, but it may run 4–10 times slower than a well-crafted bytecode interpreter. In a case study focused on implementation choices, we explore ways of making definitional interpreters faster without expending much programming effort. We implement, in OCaml, interpreters based on three semantics for a simple subset of Lua. We compile the OC...
متن کاملA Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters
A rewrite logic semantic definitional framework for programming languages is introduced, called K, together with partially automated translations of K language definitions into rewriting logic and into C. The framework is exemplified by defining SILF, a simple imperative language with functions. The translation of K definitions into rewriting logic enables the use of the various analysis tools ...
متن کاملDeriving Type Systems and Implementations for Coroutines
Starting from reduction semantics for several styles of coroutines from the literature, we apply Danvy’s method to obtain equivalent functional implementations (definitional interpreters) for them. By applying existing type systems for programs with continuations, we obtain sound type systems for coroutines through the translation. The resulting type systems are similar to earlier hand-crafted ...
متن کاملA Complete Bibliography of Publications in Higher-Order Symbolic Computation
p [6]. -Calculus [6]. Actor [9]. Algorithmic [2]. Approach [5]. Binding [8]. Calculus [6, 13]. Composable [9]. CPS [5]. Definitional [10, 11]. Direct [6]. Dynamic [8]. Editorial [1]. Extended [13]. First [12]. Generalization [3, 4]. Higher [11]. Higher-Order [11]. Interpreter [13]. Interpreters [10, 11]. Introduction [3]. Jumps [3, 4]. Labels [3, 4]. Lambda [13]. Landin [3]. Language [2]. Langu...
متن کاملFrom F to DOT: Type Soundness Proofs with Definitional Interpreters
Scala’s type system unifies aspects of ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of calculi has been proposed as a new theoretic foundation for Scala and similar expressive languages. Unfortunately, it is not clear how DOT relates to well-studied type systems from the literature, and type soundness has only been established for very restric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Higher-Order and Symbolic Computation
دوره 11 شماره
صفحات -
تاریخ انتشار 1998