NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Gödelization in the lambda calculus
Information Processing Letters
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
On Mints' Reduction for ccc-Calculus
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Program Extraction from Normalization Proofs
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Standardization and Confluence for a Lambda Calculus with Generalized Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Some Lambda Calculi with Categorial Sums and Products
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Categorical Reconstruction of a Reduction Free Normalization Proof
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Reduction-free normalisation for a polymorphic system
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Normalization and the Yoneda embedding
Mathematical Structures in Computer Science
Intuitionistic model constructions and normalization proofs
Mathematical Structures in Computer Science
Normalization by evaluation with typed abstract syntax
Journal of Functional Programming
Syntactic analysis of η-expansions in pure type systems
Information and Computation
Normalization by Evaluation for Martin-Löf Type Theory with One Universe
Electronic Notes in Theoretical Computer Science (ENTCS)
A Compiled Implementation of Normalization by Evaluation
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
On normalization by evaluation for object calculi
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Internal models of system F for decompilation
Theoretical Computer Science
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
A purely syntactic and untyped variant of Normalisation by Evaluation for the $\lambda$-calculus is presented in the framework of a two-level $\lambda$-calculus with rewrite rules to model the inverse of the evaluation functional. Among its operational properties there is a standardisation theorem that formally establishes the adequacy of implementation in functional programming languages. An example implementation in Haskell is provided. The relation to the usual type-directed Normalisation by Evaluation is highlighted, using a short analysis of $\eta$-expansion that leads to a perspicuous strong normalisation and confluence proof for $\beta\eta\!\up$-reduction as a byproduct.