Definitional interpreters for higher-order programming languages
From MaRDI portal
Publication:1290337
DOI10.1023/A:1010027404223zbMath0934.68034MaRDI QIDQ1290337
Publication date: 31 May 1999
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Related Items
A unifying approach to goal-directed evaluation, Polymorphic typed defunctionalization and concretization, A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures, Combining algebraic effects with continuations, On the relations between monadic semantics, A syntactic correspondence between context-sensitive calculi and abstract machines, Analyzing the environment structure of higher-order languages using frame strings, Types as graphs: Continuations in type logical grammar, Flattening tuples in an SSA intermediate representation, A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction, Call-by-name, call-by-value and the \(\lambda\)-calculus, A first-order one-pass CPS transformation, Enhancing dependency pair method using strong computability in simply-typed term rewriting, State-transition machines, revisited, A functional correspondence between monadic evaluators and abstract machines for languages with computational effects, Inter-deriving Semantic Artifacts for Object-Oriented Programming, A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
Uses Software
