On the Most Suitable Axiomatization of Signed Integers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

On the Most Suitable Axiomatization of Signed Integers

Abstract

The standard mathematical definition of signed integers, based on set theory, is not well-adapted to the needs of computer science. For this reason, many formal specification languages and theorem provers have designed alternative definitions of signed integers based on term algebras , by extending the Peano-style construction of unsigned naturals using "zero" and "succ" to the case of signed integers. We compare the various approaches used in CADP, CASL, Coq, Isabelle/HOL, KIV, Maude, mCRL2, PSF, SMT-LIB, TLA+, etc. according to objective criteria and suggest an "optimal" definition of signed integers.
Fichier principal
Vignette du fichier
Garavel-17.pdf (334.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01667321 , version 1 (19-12-2017)

Licence

Attribution

Identifiers

Cite

Hubert Garavel. On the Most Suitable Axiomatization of Signed Integers. 23th International Workshop on Algebraic Development Techniques (WADT), Sep 2017, Gregynog, Wales, UK, United Kingdom. pp.120-134, ⟨10.1007/978-3-319-72044-9_9⟩. ⟨hal-01667321⟩
1216 View
860 Download

Altmetric

Share

Gmail Facebook X LinkedIn More