Skip to main content
Article thumbnail
Location of Repository

Formalising LPOs and Invariants in Coq

By H. Korver and A. Sellink


In the setting of μCRL, the notions of 'linear process operator (LPO)' and 'invariant'\ud are implemented in Coq, which is a proof development tool based on type theory.\ud As a first experiment we have computer-checked a general property of a binary search\ud program in the new framework

Topics: Wijsbegeerte
Year: 1995
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.