Inter-deriving semantic artifacts for object-oriented programming

DOI10.1016/j.jcss.2009.10.004zbMath1206.68079OpenAlexW2014472503MaRDI QIDQ980939

Jacob Johannsen, Olivier Danvy

Publication date: 8 July 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.10.004

zbMATH Keywords

abstract machinereduction semanticsnatural semanticsfunctional calculus of objectsfunctional correspondencesyntactic correspondence

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Automating the functional correspondence between higher-order evaluators and abstract machines ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An abstract framework for environment machines
• A syntactic correspondence between context-sensitive calculi and abstract machines
• Refunctionalization at work
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• Definitional interpreters revisited
• Definitional interpreters for higher-order programming languages
• Back to direct style
• The origins of structural operational semantics
• A structural approach to operational semantics
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• Trampolined style
• Lightweight fusion by fixed point promotion
• From Reduction-Based to Reduction-Free Normalization
• Constructing Call-by-Value Continuation Semantics
• Two-Level Functional Languages
• Functional runtime systems within the lambda-sigma calculus
• Representing Control: a Study of the CPS Transformation
• Confluence properties of weak and strong calculi of explicit substitutions
• The Zipper
• Explicit substitutions
• Compilation and equivalence of imperative objects
• Lazy evaluation and delimited control
• A concrete framework for environment machines
• From natural semantics to C: A formal derivation of two STG machines
• A Rational Deconstruction of Landin’s SECD Machine
• On one-pass CPS transformations
• From Natural Semantics to Abstract Machines
• Making a fast curry: push/enter vs. eval/apply for higher-order languages
• Logic Based Program Synthesis and Transformation
• The Mechanical Evaluation of Expressions
• Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
• The Calculi of Lambda Conversion. (AM-6)

This page was built for publication: Inter-deriving semantic artifacts for object-oriented programming