Pages that link to "Item:Q2464723"
From MaRDI portal
The following pages link to A call-by-name lambda-calculus machine (Q2464723):
Displaying 30 items.
- Krivine machines and higher-order schemes (Q476196) (← links)
- Uniformity and the Taylor expansion of ordinary lambda-terms (Q944386) (← 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)
- Classical realizability in the CPS target language (Q1744381) (← links)
- Proving correctness of a compiler using step-indexed logical relations (Q1744423) (← links)
- Effectful applicative similarity for call-by-name lambda calculi (Q1989333) (← links)
- Evaluating lambda terms with traversals (Q2007730) (← links)
- Abstracting models of strong normalization for classical calculi (Q2291828) (← links)
- Quantitative classical realizability (Q2343127) (← links)
- Linear dependent types in a call-by-value scenario (Q2441513) (← links)
- A Classical Realizability Model for a Semantical Value Restriction (Q2802494) (← links)
- Classical By-Need (Q2802497) (← links)
- Soft linear logic and polynomial complexity classes (Q2866738) (← links)
- Simply typed fixpoint calculus and collapsible pushdown automata (Q2973243) (← links)
- Krivine Machines and Higher-Order Schemes (Q3012917) (← links)
- Systematic abstraction of abstract machines (Q3165529) (← links)
- ASMs and Operational Algorithmic Completeness of Lambda Calculus (Q3586009) (← links)
- An introduction to differential linear logic: proof-nets, models and antiderivatives (Q4577980) (← links)
- Execution time of λ-terms via denotational semantics and intersection types (Q4577984) (← links)
- Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: <i>a minimalist approach</i> (Q4637628) (← links)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus (Q4972064) (← links)
- (Q4972738) (← links)
- (Q5015272) (← links)
- Classical realizability and arithmetical formulæ (Q5360216) (← links)
- Call-by-name extensionality and confluence (Q5372008) (← links)
- Automating the functional correspondence between higher-order evaluators and abstract machines (Q6102250) (← links)
- Classical (co)recursion: Mechanics (Q6132720) (← links)
- Language transformations in the classroom (Q6643747) (← links)
- Reasonable space for the \(\lambda \)-calculus, logarithmically (Q6649482) (← links)
