Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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.
['Klaus Aehlig', 'Felix Joachimski']
I am writing a research paper on a idea Operational aspects of untyped Normalisation by Evaluation
[{"from": "human", "value": "I am writing a research paper on a idea Operational aspects of untyped Normalisation by Evaluation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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."}]