Results 1 
4 of
4
HOL Light Tutorial (for version 2.20
, 2006
"... The HOL Light theorem prover can be difficult to get started with. While the manual is fairly detailed and comprehensive, the large amount of background information that has to be absorbed before the user can do anything interesting is intimidating. Here we give an alternative ‘quick start ’ guide, ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The HOL Light theorem prover can be difficult to get started with. While the manual is fairly detailed and comprehensive, the large amount of background information that has to be absorbed before the user can do anything interesting is intimidating. Here we give an alternative ‘quick start ’ guide, aimed at teaching basic use of the system quickly by means of a graded set of examples. Some readers may find it easier to absorb; those who do not are referred after all to the standard manual. “Shouldn’t we read the instructions?”
Algorithms for nearrings of nonlinear transformations
 Proceedings of ISSAC 2000
, 2000
"... Categories and Subject �� � �� � �� � �����©�����������������������������������©���������©����������������������� ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Categories and Subject �� � �� � �� � �����©�����������������������������������©���������©�����������������������
HOL Light Tutorial (for version 2.20). http://www.cl.cam.ac.uk/ jrh13/hollight/tutorial 220.pdf
"... The HOL Light theorem prover can be difficult to get started with. While the manual is fairly detailed and comprehensive, the large amount of background information that has to be absorbed before the user can do anything interesting is intimidating. Here we give an alternative ‘quick start ’ guide, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The HOL Light theorem prover can be difficult to get started with. While the manual is fairly detailed and comprehensive, the large amount of background information that has to be absorbed before the user can do anything interesting is intimidating. Here we give an alternative ‘quick start ’ guide, aimed at teaching basic use of the system quickly by means of a graded set of examples. Some readers may find it easier to absorb; those who do not are referred after all to the standard manual. “Shouldn’t we read the instructions?”
Algorithms for Finite Nearrings and their NGroups
"... In this note, we present algorithms to deal with finite nearrings, the appropriate algebraic structure to study nonlinear functions on finite groups. Just as rings (of matrices) operate on vector spaces, nearrings operate on groups. In our approach, we have developed efficient algorithms for a va ..."
Abstract
 Add to MetaCart
In this note, we present algorithms to deal with finite nearrings, the appropriate algebraic structure to study nonlinear functions on finite groups. Just as rings (of matrices) operate on vector spaces, nearrings operate on groups. In our approach, we have developed efficient algorithms for a variety of problems that involve the structure of the operation of a nearring on a group. From this, we retrieve information about the nearring itself.