Pages that link to "Item:Q4818938"
From MaRDI portal
The following pages link to Operational aspects of untyped Normalisation by Evaluation (Q4818938):
Displaying 16 items.
- Internal models of system F for decompilation (Q428882) (← links)
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters (Q884953) (← links)
- Term rewriting for normalization by evaluation. (Q1401941) (← links)
- Syntactic analysis of \(\eta\)-expansions in pure type systems. (Q1873755) (← links)
- Evaluating lambda terms with traversals (Q2007730) (← links)
- The simple type theory of normalisation by evaluation (Q2841227) (← links)
- A compiled implementation of normalisation by evaluation (Q2913943) (← links)
- On Normalization by Evaluation for Object Calculi (Q3499758) (← links)
- A Compiled Implementation of Normalization by Evaluation (Q3543648) (← links)
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (Q3637183) (← links)
- Normalization by Evaluation for Typed Weak lambda-Reduction (Q5091147) (← links)
- Normalization by Evaluation for Martin-Löf Type Theory with One Universe (Q5262927) (← links)
- Functional and Logic Programming (Q5308026) (← links)
- Foundations of Software Science and Computation Structures (Q5308449) (← links)
- Denotational aspects of untyped normalization by evaluation (Q5313717) (← links)