FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS

DOI10.1142/S0129054101000448zbMath1319.68050OpenAlexW2050975971WikidataQ62038270 ScholiaQ62038270MaRDI QIDQ5249253

Robert Glück, Sergey A. Abramov

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054101000448

zbMATH Keywords

programming languagesprogram transformationpartial evaluationsupercompilationinterpretersnonstandard semantics

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)

Related Items

Reversible computing from a programming language perspective ⋮ Reverse universal resolving algorithm and inverse driving

Cites Work

• Essence of generalized partial computation
• Running programs backwards: The logical inversion of imperative computation
• The concept of a supercompiler
• Algorithm = logic + control
• A positive supercompiler
• Generating action compilers by partial evaluation
• A formalism for translator interactions