Published August 19, 2017 | Version v1
Conference paper Open

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic

Creators

  • 1. Technische Universität München
  • 2. Vrije Universiteit Amsterdam and Max-Planck-Institut für Informatik
  • 3. InstantJob
  • 4. Ludwig-Maximilians-Universität München
  • 5. Max-Planck-Institut für Informatik
  • 6. Carnegie Mellon University
  • 7. ETH Zürich
  • 8. Google Zurich
  • 9. Technische Universiteit Eindhoven
  • 10. Middlesex University London and Institute of Mathematics Simion Stoilow of the Romanian Academy
  • 11. Universität Innsbruck

Description

We describe a line of work that started in 2011 towards enriching Isabelle/HOL’s language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously supported by any system based on higher-order logic. These (co)datatypes are complemented by definitional principles for (co)recursive functions and reasoning principles for (co)induction. In contrast with other systems offering codatatypes, no additional axioms or logic extensions are necessary with our approach.

Files

Foundational (Co)datatypes and (Co)recursion.pdf

Files (200.4 kB)

Name Size Download all
md5:1f8d9cabe293cbd74a03677d4f93fb0d
200.4 kB Preview Download

Additional details

Related works

Is new version of
10.1007/978-3-319-66167-4_1 (DOI)

Funding

ECRYPT-NET – European Integrated Research Training Network on Advanced Cryptographic Technologies for the Internet of Things and the Cloud 643161
European Commission