Pages that link to "Item:Q4764616"
From MaRDI portal
The following pages link to Efficient self-interpretation in lambda calculus (Q4764616):
Displayed 24 items.
- Gödelization in the lambda calculus (Q294781) (← links)
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- A lean specification for gadts: System F with first-class equality proofs (Q656862) (← links)
- Directly reflective meta-programming (Q848742) (← links)
- An investigation of Jones optimality and BTI-universal specializers (Q1029807) (← links)
- The development of a partial evaluator for extended lambda calculus (Q1264617) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- Programs as data structures in \(\lambda\)SF-calculus (Q1744389) (← links)
- The self-reduction in lambda calculus (Q1978706) (← links)
- Self-quotation in a typed, intensional lambda-calculus (Q2130593) (← links)
- The \textsc{MetaCoq} project (Q2209542) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- From realizability to induction via dependent intersection (Q2636522) (← links)
- Unified Syntax with Iso-types (Q3179296) (← links)
- (Q3300796) (← links)
- ASMs and Operational Algorithmic Completeness of Lambda Calculus (Q3586009) (← links)
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages (Q3644934) (← links)
- The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
- (Q4625694) (← links)
- (Q5013873) (← links)
- Many more predecessors: A representation workout (Q5110930) (← links)
- (Q5111316) (← links)
- The calculus of dependent lambda eliminations (Q5372010) (← links)
- Programming in the λ-Calculus: From Church to Scott and Back (Q5410454) (← links)