A semantic account of type-directed partial evaluation
From MaRDI portal
Recommendations
Cited in
(22)- Partial evaluation with inference rules
- Term rewriting for normalization by evaluation.
- Two-level languages for program optimization
- Encoding types in ML-like languages
- scientific article; zbMATH DE number 1692906 (Why is no real title available?)
- scientific article; zbMATH DE number 1696586 (Why is no real title available?)
- The simple type theory of normalisation by evaluation
- Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
- Type-safe pattern combinators
- scientific article; zbMATH DE number 177846 (Why is no real title available?)
- scientific article; zbMATH DE number 2018582 (Why is no real title available?)
- scientific article; zbMATH DE number 2036333 (Why is no real title available?)
- scientific article; zbMATH DE number 1538028 (Why is no real title available?)
- scientific article; zbMATH DE number 2090724 (Why is no real title available?)
- On-line and off-line partial evaluation: semantic specifications and correctness proofs
- Type directed partial evaluation for level-1 shift and reset
- Normalization by Evaluation for Martin-Löf Type Theory with One Universe
- Denotational aspects of untyped normalization by evaluation
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
- Semantic analysis of normalisation by evaluation for typed lambda calculus
- A unifying approach to goal-directed evaluation
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
This page was built for publication: A semantic account of type-directed partial evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494371)
