Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: I have shown, in this paper, surprisingly simple first-class dependently typed records with manifest types. The manifest types are extended by a simple with notation. They have no built-in notion of subtyping, but coercive subtyping gives them a more flexible notion than the usual structured record subtyping. I have not developed any meta-theory, but these records are interpretable in type theory with inductiveky-recursive definitions. These records are suggested for formalizing mathematical structures, not necessarily as modules for separate checking or proof libraries.
['Robert Pollack']
I am writing a research paper on a idea Dependently Typed Records for Representing Mathematical Structure
[{"from": "human", "value": "I am writing a research paper on a idea Dependently Typed Records for Representing Mathematical Structure"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: I have shown, in this paper, surprisingly simple first-class dependently typed records with manifest types. The manifest types are extended by a simple with notation. They have no built-in notion of subtyping, but coercive subtyping gives them a more flexible notion than the usual structured record subtyping. I have not developed any meta-theory, but these records are interpretable in type theory with inductiveky-recursive definitions. These records are suggested for formalizing mathematical structures, not necessarily as modules for separate checking or proof libraries."}]