Pages that link to "Item:Q5277795"
From MaRDI portal
The following pages link to A concrete framework for environment machines (Q5277795):
Displaying 14 items.
- A correspondence between type checking via reduction and type checking via evaluation (Q763480) (← links)
- An abstract framework for environment machines (Q804281) (← links)
- A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356) (← 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)
- Simply typed lambda calculus with first-class environments (Q1894315) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Systematic abstraction of abstract machines (Q3165529) (← links)
- From Outermost Reduction Semantics to Abstract Machine (Q3453649) (← links)
- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
- From Reduction-Based to Reduction-Free Normalization (Q3649133) (← links)
- (Q4263880) (← links)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus (Q4972064) (← links)
- A Logical Foundation for Environment Classifiers (Q5894005) (← links)
