Abstract

This paper provided some logical structures over fibration including comprehension and equation functor, then described semantic behavior by corecursion, also represented universal coinductive rule in a fibrational setting. Comparing the traditional methods, our works do not rely on special semantics computation context, which can analyze semantics elaborately of indexed coinductive data type and described its coinductive rule.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.