Automatic autoprojection of recursive equations with global variables and abstract data types
From MaRDI portal
Publication:1183547
DOI10.1016/0167-6423(91)90002-FzbMath0745.68073OpenAlexW2090036644MaRDI QIDQ1183547
Publication date: 28 June 1992
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(91)90002-f
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items
Representing Control: a Study of the CPS Transformation ⋮ Shifting the stage ⋮ A partial evaluator for a parallel lambda language ⋮ On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation ⋮ Generating action compilers by partial evaluation ⋮ Binding-time analysis for both static and dynamic expressions ⋮ Automatically Splitting a Two-Stage Lambda Calculus ⋮ Semantics-directed compilation of nonlinear patterns ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages ⋮ Representing Control: a Study of the CPS Transformation ⋮ Total unfolding: theory and applications
