Skip to content

Fixing some typos in domains.md#4905

Open
dkcumming wants to merge 2 commits intodevelopfrom
dc/typos
Open

Fixing some typos in domains.md#4905
dkcumming wants to merge 2 commits intodevelopfrom
dc/typos

Conversation

@dkcumming
Copy link
Contributor

Found some typos in domains.md that I thought I should fix:

  • "expoennt" -> "exponent"
  • "equasl" -> "equals"

Copy link
Contributor

@tothtamas28 tothtamas28 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM.

I used an LLM to double-check and it found a few more typos, feel free to fix those as well if you have the time.

set it is matching and N is the number of elements being matched. When it
appears on the left hand side containing variables not bound elsewhere in the
term, it is O(N^K) where N is the size of the set it is matching and K is the
number of unbound keys being mached. In other words, one unbound variable is
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

mached -> matched


### List elements

An element of a `List` is constucted via the `ListItem` operator.
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

constucted -> constructed

You can get an element of a list by its integer offset in O(log(N)) time, or
effectively constant. Positive `Int` indices are 0-indexed from the beginning of the
list, and negative indices are -1-indexed from the end of the list. In other
words, 0 is the first element and -1 is the last element. The indice can also be
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

indice -> index


You can create a new `List` which is equal to `dest` except the `N` elements
starting at `index` are replaced with the contents of `src` in O(N*log(K)) time
(where `K` is the size of `dest`and `N` is the size of `src`), or effectively linear. Having `index + N > K` yields an exception.
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

`dest`and` -> `dest` and

### Bit slicing

You can compute the value of a range of bits in the twos-complement
representation of an integer, as interpeted either unsigned or signed, of an
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

interpeted -> interpreted

* Compute the natural logarithm `logFloat` of a float.
* Compute the sine `sinFloat` of a float.
* Compute the cosine `cosFloat` of a float.
* Compute the tangent `tanFlooat` of a float.
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

tanFlooat -> tanFloat

zero if it is not present. Finally, it is rounded to the nearest possible
value in a floating-point type represented like an IEEE754 floating-point type,
with the number of bits of precision and exponent specified by the suffix.
A suffix of `f` or `f` represents the IEEE `binary32` format. A suffix of `d`
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

`f` or `f` -> `f` or `F`


rule [eq-k-to-eq-int] : I1:Int ==K I2:Int => I1 ==Int I2 [simplification]
rule [eq-int-true-left] : {K1 ==Int K2 #Equals true} => {K1 #Equals K2} [simplification]
rule [eq-int-true-rigth] : {true #Equals K1 ==Int K2} => {K1 #Equals K2} [simplification]
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

rigth -> right

rule [eq-int-true-left] : {K1 ==Int K2 #Equals true} => {K1 #Equals K2} [simplification]
rule [eq-int-true-rigth] : {true #Equals K1 ==Int K2} => {K1 #Equals K2} [simplification]
rule [eq-int-false-left] : {K1 ==Int K2 #Equals false} => #Not({K1 #Equals K2}) [simplification]
rule [eq-int-false-rigth] : {false #Equals K1 ==Int K2} => #Not({K1 #Equals K2}) [simplification]
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

rigth -> right

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants