Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  define a novel inference system for strictness and totality analysis for the simply-typed lazy lambda-calculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those terms that definitely do not denote bottom (i.e. do evaluate to WHNF). The analysis is presented as an annotated type system allowing conjunctions at top-level only.  give examples of its use and prove the correctness with respect to a natural-style operational semantics.
['Kirsten Lackner Solberg Gasser', 'Hanne Riis Nielson', 'Flemming Nielson']
I am writing a research paper on a idea Strictness and totality analysis
[{"from": "human", "value": "I am writing a research paper on a idea Strictness and totality analysis"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  define a novel inference system for strictness and totality analysis for the simply-typed lazy lambda-calculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those terms that definitely do not denote bottom (i.e. do evaluate to WHNF). The analysis is presented as an annotated type system allowing conjunctions at top-level only.  give examples of its use and prove the correctness with respect to a natural-style operational semantics."}]