Enable more descriptive names for quantifiers and logical constants #111
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The new functions "set_verbose_symbols" and "unset_verbose_symbols"
enable and disable, respectively, more verbose and descriptive names
for some logical symbols; these are now enabled by default:
F -> false
T -> true
! -> forall
? -> exists
?! -> existsunique
This is all done via interface maps. Not only is the underlying term
structure unchanged (the "actual" names are the symbolic ones) but
also the original syntax is accepted as an alternative:
# `exists x. x = 1` = `?x. x = 1`;;
val it : bool = true
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The new functions "set_verbose_symbols" and "unset_verbose_symbols" enable and disable, respectively, more verbose and descriptive names for some logical symbols; these are now enabled by default:
This is all done via interface maps. Not only is the underlying term structure unchanged (the "actual" names are the symbolic ones) but also the original syntax is accepted as an alternative:
exists x. x = 1=?x. x = 1;;val it : bool = true