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
Soundness Conditions for Big-Step Semantics, Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap, A first-order one-pass CPS transformation, Polymorphic typed defunctionalization and concretization, A functional correspondence between call-by-need evaluators and lazy abstract machines, Getting There and Back Again, 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, Normalization by evaluation for modal dependent type theory, Programming language semantics: It’s easy as 1,2,3, Automating the functional correspondence between higher-order evaluators and abstract machines, Inter-deriving Semantic Artifacts for Object-Oriented Programming, On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation, Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus, Control-flow analysis of function calls and returns by abstract interpretation, Enhancing dependency pair method using strong computability in simply-typed term rewriting, Agent-Based Modeling and Computer Languages, State-transition machines, revisited, Functional Semantics, A Selective CPS Transformation, On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion, Inter-deriving semantic artifacts for object-oriented programming, Call-by-name, call-by-value and the \(\lambda\)-calculus, A unifying approach to goal-directed evaluation, A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs, Types as graphs: Continuations in type logical grammar, Limited second-order functionality in a first-order setting, Flattening tuples in an SSA intermediate representation, On the dynamic extent of delimited continuations, A functional correspondence between monadic evaluators and abstract machines for languages with computational effects, Proof-directed program transformation: A functional account of efficient regular expression matching, A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
Uses Software
