Implementing Polymorphism in Zenon

6 pages•Published: September 27, 2016

Guillaume Bury, Raphaël Cauderlier and Pierre Halmagrand

Abstract

Extending first-order logic with ML-style polymorphism allows to define
generic axioms dealing with several sorts. Until recently, most
automated theorem provers relied on preprocess encodings into
mono/many-sorted logic to reason within such theories. In this paper, we
discuss the implementation of polymorphism into the
first-order tableau-based automated theorem prover Zenon. This
implementation leads to slightly modify some basic parts of the code,
from the representation of expressions to the proof-search algorithm.

Keyphrases: automated theorem proving, first order logic, ml polymorphism, tableau method

In: Boris Konev, Stephan Schulz and Laurent Simon (editors). IWIL-2015. 11th International Workshop on the Implementation of Logics, vol 40, pages 15-20.

Links:	https://easychair.org/publications/paper/mH
	https://doi.org/10.29007/87vl

BibTeX entry

@inproceedings{IWIL-2015:Implementing_Polymorphism_Zenon,
  author    = {Guillaume Bury and Raphaël Cauderlier and Pierre Halmagrand},
  title     = {Implementing Polymorphism in Zenon},
  booktitle = {IWIL-2015. 11th International Workshop on the Implementation of Logics},
  editor    = {Boris Konev and Stephan Schulz and Laurent Simon},
  series    = {EPiC Series in Computing},
  volume    = {40},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/mH},
  doi       = {10.29007/87vl},
  pages     = {15-20},
  year      = {2016}}

Download PDF Open PDF in browser