Inter-deriving semantic artifacts for object-oriented programming
Olivier Danvy,Jacob Johannsen +1 more
28
TL;DR: Three new semantic artifacts for a version of Abadi and Cardelli's calculus with explicit substitutions are presented: a reduction semantics, an environment-based abstract machine, and a natural semantics (i.e., an interpreter) with environments.
read more
About: This article is published in Journal of Computer and System Sciences. The article was published on 01 Aug 2010. and is currently open access. The article focuses on the topics: Operational semantics & Denotational semantics.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On the Equivalence between Small-Step and Big-Step Abstract Machines: A Simple Application of Lightweight Fusion
Olivier Danvy,Kevin Millikin +1 more
TL;DR: It is shown how Ohori and Sasano's recent lightweight fusion by fixed-point promotion provides a simple way to prove the equivalence of the two standard styles of specification of abstract machines: in small-step form, as a state-transition function together with a `driver loop,' and in big- step form as a tail-recursive function that directly maps a given configuration to a final state, if any.
A Case for Dynamic Reverse-code Generation
TL;DR: This article presents a case study of dynamic reverse-code generation, a method to generate reverse code on the fly while running a debugger, and compares the memory usage of various backtracking methods in a simple but nontrivial example, a bounded-buffer program.
14
First-class isomorphic specialization by staged evaluation
Alexander Vladimirovich Slesarenko,Alexander Nikolaevich Filippov,Alexey Romanov +2 more
- 26 Aug 2014
TL;DR: A systematic approach and formalized framework for implementing software components with a first-class specialization capability and shows how to extend a higher-order functional language with abstraction mechanisms carefully designed to provide automatic and guaranteed elimination of abstraction overhead.
13
An Investigation of Abadi and Cardelli's Untyped Calculus of Objects
TL;DR: It is proved that the two calculi are computationally equivalent, and the two abstract machines are strongly bisimilar, which establishes the equivalence of the natural semantics and the reduction semantics of the new calculus.
Collapsing towers of interpreters
Nada Amin,Tiark Rompf +1 more
- 27 Dec 2017
TL;DR: In this article, a multi-level lambda calculus is proposed to collapse a tower of interpreters into a compiler that removes all interpretive overhead and runs in a single pass, i.e., a sequence of multiple interpreters interpreting one another as input programs.
11
References
•Book
The Lambda Calculus. Its Syntax and Semantics
Henk Barendregt
- 30 Apr 2012
TL;DR: In this article, the Lambda-Calculus has been studied as a theory of composition and reduction, and the theory of reduction has been used to construct models of Lambda Theories.
2.9K
•Book
Partial evaluation and automatic program generation
Neil D. Jones,Carsten Krogh Gomard,Peter Sestoft +2 more
- 01 Jan 1993
TL;DR: This paper presents a guide to the literature the self-applicable scheme specializer, a partial evaluator for a subset of scheme for a first-order functional languages.
1.7K
•Book
The calculi of lambda-conversion
Barkley Rosser
- 01 Jan 1941
TL;DR: The Calculi of Lambda Conversion as discussed by the authors is a book about Lambda conversion with a focus on the Lambda transformation process, and it is available in bookstores. (AM-6)
1.3K
The Mechanical Evaluation of Expressions
TL;DR: It is shown how some forms of expression in current programming languages can be modelled in Church's X-notation, and a way of "interpreting" such expressions is described, which suggests a method of analyzing the things computer users write.