Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The framework of  Light Logics  has been extensively studied to control the complexity of higher-order functional programs.  propose an extension of this framework to multithreaded programs with side effects, focusing on the case of polynomial time. After introducing a modal λ-calculus with parallel composition and regions,  prove that a realistic call-by-value evaluation strategy can be computed in polynomial time for a class of ll-formed programs. The result relies on the simulation of call-by-value by a polynomial  shallow-first  strategy which preserves the evaluation order of side effects. Then,  provide a polynomial type system that guarantees that ll-typed programs do not go wrong. Finally,  illustrate the expressivity of the type system by giving a programming example of concurrent iteration producing side effects over an inductive data structure.
['Antoine Madet']
I am writing a research paper on a idea A polynomial time λ-calculus with multithreading and side effects
[{"from": "human", "value": "I am writing a research paper on a idea A polynomial time \u03bb-calculus with multithreading and side effects"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The framework of  Light Logics  has been extensively studied to control the complexity of higher-order functional programs.  propose an extension of this framework to multithreaded programs with side effects, focusing on the case of polynomial time. After introducing a modal \u03bb-calculus with parallel composition and regions,  prove that a realistic call-by-value evaluation strategy can be computed in polynomial time for a class of ll-formed programs. The result relies on the simulation of call-by-value by a polynomial  shallow-first  strategy which preserves the evaluation order of side effects. Then,  provide a polynomial type system that guarantees that ll-typed programs do not go wrong. Finally,  illustrate the expressivity of the type system by giving a programming example of concurrent iteration producing side effects over an inductive data structure."}]