Skip navigation
Skip navigation

Isabelle theories for machine words

Dawson, Jeremy


We describe a collection of Isabelle theories which facilitate reasoning about machine words. For each possible word length, the words of that length form a type, and most of our work consists of generic theorems which can be applied to any such type. We

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Electronic Notes in Theoretical Computer Science
DOI: 10.1016/j.entcs.2009.08.005


File Description SizeFormat Image
01_Dawson_Isabelle_theories_for_machine_2009.pdf187.41 kBAdobe PDF    Request a copy
02_Dawson_Isabelle_theories_for_machine_2009.pdf61.22 kBAdobe PDF    Request a copy
03_Dawson_Isabelle_theories_for_machine_2009.pdf37.14 kBAdobe PDF    Request a copy
04_Dawson_Isabelle_theories_for_machine_2009.pdf150.6 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator