The following pages link to The categorical abstract machine (Q1097043):
Displaying 34 items.
- An abstract framework for environment machines (Q804281) (← links)
- Compilation of extended recursion in call-by-value functional languages (Q848739) (← links)
- Formal compiler construction in a logical framework (Q853741) (← links)
- Alpha conversion, conditions on variables and categorical logic (Q913792) (← links)
- A verified framework for higher-order uncurrying optimizations (Q968367) (← links)
- Coinductive big-step operational semantics (Q1012129) (← links)
- Unique normal forms for lambda calculus with surjective pairing (Q1117204) (← links)
- Partiality, cartesian closedness, and toposes (Q1121368) (← links)
- A notation for lambda terms. A generalization of environments (Q1129257) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Categorical abstract machines for higher-order typed \(\lambda\)-calculi (Q1349667) (← links)
- Linear-time hierarchies for a functional language machine model (Q1818323) (← links)
- The next 700 Krivine machines (Q2464721) (← links)
- State-transition machines, revisited (Q2464722) (← links)
- Definability and full abstraction (Q2864154) (← links)
- π-RED<sup>+</sup> An interactive compiling graph reduction system for an applied λ-calculus (Q3125230) (← links)
- (Q3201049) (← links)
- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
- iRho: an imperative rewriting calculus (Q3520144) (← links)
- On the efficiency of categorical combinators as a rewriting system (Q3782744) (← links)
- From operational semantics to abstract machines (Q4279254) (← links)
- The Vienna abstract machine (Q4339848) (← links)
- The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
- A categorical understanding of environment machines (Q4763978) (← links)
- Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis<sup>†</sup> (Q4880526) (← links)
- On Extracting Static Semantics (Q4917055) (← links)
- Using transformations in the implementation of higher-order functions (Q4939691) (← links)
- Decomposing typed lambda calculus into a couple of categorical programming languages (Q5057475) (← links)
- A categorical reduction system for linear logic (Q5137919) (← links)
- New Developments in Environment Machines (Q5170161) (← links)
- Abstracting abstract machines (Q5176929) (← links)
- THE SOUNDNESS OF EXPLICIT SUBSTITUTION WITH NAMELESS VARIABLES (Q5248982) (← links)
- Formal Methods for Components and Objects (Q5311298) (← links)
- The York Abstract Machine (Q5404181) (← links)
