Skip to main content

Inductive-Inductive Definitions

  • Conference paper
Computer Science Logic (CSL 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6247))

Included in the following conference series:

Abstract

We present a principle for introducing new types in type theory which generalises strictly positive indexed inductive data types. In this new principle a set A is defined inductively simultaneously with an A-indexed set B, which is also defined inductively. Compared to indexed inductive definitions, the novelty is that the index set A is generated inductively simultaneously with B. In other words, we mutually define two inductive sets, of which one depends on the other.

Instances of this principle have previously been used in order to formalise type theory inside type theory. However the consistency of the framework used (the theorem prover Agda) is not so clear, as it allows the definition of a universe containing a code for itself. We give an axiomatisation of the new principle in such a way that the resulting type theory is consistent, which we prove by constructing a set-theoretic model.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aczel, P.: On relating type theories and set theories. In: Altenkirch, T., Naraschewski, W., Reus, B. (eds.) TYPES 1998. LNCS, vol. 1657, pp. 1–18. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Backhouse, R., Chisholm, P., Malcolm, G., Saaman, E.: Do-it-yourself type theory. Formal Aspects of Computing 1(1), 19–84 (1989)

    Article  Google Scholar 

  3. Benke, M., Dybjer, P., Jansson, P.: Universes for generic programs and proofs in dependent type theory. Nordic Journal of Computing 10, 265–269 (2003)

    MATH  MathSciNet  Google Scholar 

  4. Chapman, J.: Type theory should eat itself. Electronic Notes in Theoretical Computer Science 228, 21–36 (2009)

    Article  Google Scholar 

  5. Danielsson, N.: A formalisation of a dependently typed language as an inductive-recursive family. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 93–109. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Dybjer, P.: Inductive families. Formal aspects of computing 6(4), 440–465 (1994)

    Article  MATH  Google Scholar 

  7. Dybjer, P.: Internal type theory. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158, pp. 120–134. Springer, Heidelberg (1996)

    Google Scholar 

  8. Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic 65(2), 525–549 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dybjer, P., Setzer, A.: A finite axiomatization of inductive-recursive definitions. In: Girard, J. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 129–146. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Dybjer, P., Setzer, A.: Induction–recursion and initial algebras. Annals of Pure and Applied Logic 124(1-3), 1–47 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Dybjer, P., Setzer, A.: Indexed induction–recursion. Journal of logic and algebraic programming 66(1), 1–49 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. Martin-Löf, P.: Intuitionistic type theory. Bibliopolis Naples (1984)

    Google Scholar 

  13. Morris, P.: Constructing Universes for Generic Programming. Ph.D. thesis, University of Nottingham (2007)

    Google Scholar 

  14. Nordvall Forsberg, F., Setzer, A.: Induction-induction: Agda development and extended version (2010), http://cs.swan.ac.uk/~csfnf/induction-induction/

  15. Palmgren, E.: On universes in type theory. In: Sambin, G., Smith, J. (eds.) Twenty five years of constructive type theory, pp. 191–204. Oxford University Press, Oxford (1998)

    Google Scholar 

  16. Streicher, T.: Investigations into intensional type theory. Habilitiation Thesis (1993)

    Google Scholar 

  17. The Agda Team: The Agda wiki (2010), http://wiki.portal.chalmers.se/agda/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nordvall Forsberg, F., Setzer, A. (2010). Inductive-Inductive Definitions. In: Dawar, A., Veith, H. (eds) Computer Science Logic. CSL 2010. Lecture Notes in Computer Science, vol 6247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15205-4_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15205-4_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15204-7

  • Online ISBN: 978-3-642-15205-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics