Skip to main content

Indexed Coinduction in a Fibrational Setting

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2018)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Greiner, J.: Programming with inductive and co-inductive types. School of Computer Science, Carnegie Mellon University, Pittsburgh, USA (1992)

    Google Scholar 

  2. Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3–80 (2000)

    Article  MathSciNet  Google Scholar 

  3. Johnson, M., Rosebrugh, R., Wood, R.J.: Lenses, fibrations and universal translations. Math. Struct. Comput. Sci. 22, 25–42 (2012)

    Article  MathSciNet  Google Scholar 

  4. Miao, D.C., Xi, J.Q., Jia, L.Y., et al.: Formal language algebraic model. J. South China Univ. Technol. (Nat. Sci. Ed.) 39(10), 74–78 (2011)

    Google Scholar 

  5. Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Inf. Comput. 145(2), 107–152 (1998)

    Article  MathSciNet  Google Scholar 

  6. Barr, M., Wells, C.: Category Theory for Computing Science. Prentice-Hall, NewYork (1990)

    MATH  Google Scholar 

  7. Ghani, N., Johann, P., Fumex, C.: Indexed induction and coinduction, fibrationally. Log. Methods Comput. Sci. 9(3–6), 1–31 (2013)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This study is supported by Guangdong Province High School Outstanding Young Teacher Training Project, China (Grant No. YQ2014155) and Guangdong Provincial Natural Science Foundation, China (Grant No. 2018A0303130274).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Decheng Miao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Miao, D., Xi, J. (2018). Indexed Coinduction in a Fibrational Setting. In: Hu, T., Wang, F., Li, H., Wang, Q. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2018. Lecture Notes in Computer Science(), vol 11338. Springer, Cham. https://doi.org/10.1007/978-3-030-05234-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05234-8_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05233-1

  • Online ISBN: 978-3-030-05234-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics