Pages that link to "Item:Q5734774"
From MaRDI portal
The following pages link to The Mechanical Evaluation of Expressions (Q5734774):
Displaying 50 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Specification patterns for reasoning about recursion through the store (Q393092) (← links)
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- A survey of state vectors (Q458456) (← links)
- On graph rewriting, reduction, and evaluation in the presence of cycles (Q526460) (← links)
- The Peter Landin prize (Q604860) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- An abstract framework for environment machines (Q804281) (← links)
- A variadic extension of Curry's fixed-point combinator (Q812092) (← links)
- Peter J. Landin (1930--2009) (Q848746) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- A functional computation model for the duality of two-variable lambda-Boolean functions (Q861192) (← links)
- A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures (Q877828) (← links)
- A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356) (← links)
- Alpha conversion, conditions on variables and categorical logic (Q913792) (← links)
- Computation, hypercomputation, and physical science (Q959046) (← links)
- On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion (Q963342) (← links)
- A verified framework for higher-order uncurrying optimizations (Q968367) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- Inter-deriving semantic artifacts for object-oriented programming (Q980939) (← links)
- Coinductive big-step operational semantics (Q1012129) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- A syntactic theory of sequential control (Q1101435) (← links)
- Inheritance hierarchies: Semantics and unifications (Q1124313) (← links)
- The chemical abstract machine (Q1190491) (← links)
- An implementation of syntax directed functional programming on nested- stack machines (Q1194207) (← links)
- The revised report on the syntactic theories of sequential control and state (Q1199538) (← links)
- Call-by-name, call-by-value and the \(\lambda\)-calculus (Q1225449) (← links)
- Language design methods based on semantic principles (Q1225927) (← links)
- Least fixed points revisited (Q1234588) (← links)
- A syntactic theory of sequential state (Q1263961) (← links)
- A constructive logic behind the catch and throw mechanism (Q1337695) (← links)
- Label-selective \(\lambda\)-calculus syntax and confluence (Q1350342) (← links)
- A first order logic of effects (Q1390955) (← links)
- The definition of Extended ML: A gentle introduction (Q1391731) (← links)
- Algebraic models of correctness for abstract pipelines. (Q1426058) (← links)
- Lambda-dropping: Transforming recursive equations into programs with block structure (Q1583366) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Proving correctness of a compiler using step-indexed logical relations (Q1744423) (← links)
- Algebraic models of microprocessors architecture and organisation (Q1815999) (← links)
- Primitives for resource management in a demand-driven reduction model (Q1819923) (← links)
- Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
- The origins of structural operational semantics (Q1878710) (← links)
- Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
- On the concurrent computational content of intermediate logics (Q1989344) (← links)
- Evaluating lambda terms with traversals (Q2007730) (← links)
- A lazy desugaring system for evaluating programs with sugars (Q2163178) (← links)
- Safe functional systems through integrity types and verified assembly (Q2220814) (← links)
- A functional correspondence between call-by-need evaluators and lazy abstract machines (Q2390256) (← links)
