Pages that link to "Item:Q1290337"
From MaRDI portal
The following pages link to Definitional interpreters for higher-order programming languages (Q1290337):
Displaying 42 items.
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- Polymorphic typed defunctionalization and concretization (Q853737) (← links)
- A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures (Q877828) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356) (← links)
- Analyzing the environment structure of higher-order languages using frame strings (Q879361) (← links)
- On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion (Q963342) (← links)
- Inter-deriving semantic artifacts for object-oriented programming (Q980939) (← links)
- Types as graphs: Continuations in type logical grammar (Q1006443) (← links)
- A new interpretor for PARI/GP (Q1026973) (← links)
- Flattening tuples in an SSA intermediate representation (Q1029812) (← links)
- On the dynamic extent of delimited continuations (Q1044694) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Call-by-name, call-by-value and the \(\lambda\)-calculus (Q1225449) (← links)
- A generalization of jumps and labels (Q1290331) (← links)
- Definitional interpreters revisited (Q1290336) (← links)
- Referential transparency, definiteness and unfoldability (Q1823006) (← links)
- A first-order one-pass CPS transformation (Q1884883) (← links)
- Limited second-order functionality in a first-order setting (Q2303245) (← links)
- A functional correspondence between call-by-need evaluators and lazy abstract machines (Q2390256) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- State-transition machines, revisited (Q2464722) (← links)
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031) (← links)
- Embedding an interpreted language using higher-order functions and types (Q2913927) (← links)
- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (Q3617429) (← links)
- Implementation of an interpreter for abstract equations (Q3719790) (← links)
- A Selective CPS Transformation (Q4917063) (← links)
- Proof-directed program transformation: A functional account of efficient regular expression matching (Q5016216) (← links)
- Soundness Conditions for Big-Step Semantics (Q5041092) (← links)
- Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap (Q5041093) (← links)
- Getting There and Back Again (Q5074057) (← links)
- Agent-Based Modeling and Computer Languages (Q5150314) (← links)
- Functional Semantics (Q5410451) (← links)
- Control-flow analysis of function calls and returns by abstract interpretation (Q5891553) (← links)
- A unifying approach to goal-directed evaluation (Q5957058) (← links)
- Normalization by evaluation for modal dependent type theory (Q6065506) (← links)
- Programming language semantics: It’s easy as 1,2,3 (Q6065508) (← links)
- Automating the functional correspondence between higher-order evaluators and abstract machines (Q6102250) (← links)
- A bounded model checking technique for higher-order programs (Q6535909) (← links)
