<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06085009</id>
  <dt>a</dt>
  <an>06085009</an>
  <augroup>
    <au>Armstrong, Alasdair</au>
    <au>Struth, Georg</au>
  </augroup>
  <ti>Automated reasoning in higher-order regular algebra.</ti>
  <so>Kahl, Wolfram (ed.) et al., Relational and algebraic methods in computer science. 13th international conference, RAMiCS 2012, Cambridge, UK, September 17--20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33313-2/pbk). Lecture Notes in Computer Science 7560, 66-81 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-33314-9_5</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We extend a large Isabelle/HOL repository for regular algebras towards higher-order variants based on directed sets and quantales, including reasoning based on general fixpoint properties and Galois connections. In this context we demonstrate that Isabelle's recent integration of automated theorem proving technology effectively supports higher-order reasoning. We present four case studies that underpin this claim: the calculus of Galois connections and fixpoints, action algebras and Galois connections, solvability conditions for regular equations and fixpoint fusion, and the implementation of formal language quantales.</ab>
    <rv></rv>
  </abgroup>
</item>