Computer Science – Logic in Computer Science
Scientific paper
2011-03-17
EPTCS 53, 2011, pp. 47-61
Computer Science
Logic in Computer Science
In Proceedings TYPES 2009, arXiv:1103.3111
Scientific paper
10.4204/EPTCS.53.4
We present a version of the HOL Light system that supports undoing definitions in such a way that this does not compromise the soundness of the logic. In our system the code that keeps track of the constants that have been defined thus far has been moved out of the kernel. This means that the kernel now is purely functional. The changes to the system are small. All existing HOL Light developments can be run by the stateless system with only minor changes. The basic principle behind the system is not to name constants by strings, but by pairs consisting of a string and a definition. This means that the data structures for the terms are all merged into one big graph. OCaml - the implementation language of the system - can use pointer equality to establish equality of data structures fast. This allows the system to run at acceptable speeds. Our system runs at about 85% of the speed of the stateful version of HOL Light.
No associations
LandOfFree
Stateless HOL does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Stateless HOL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stateless HOL will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-247383