Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update paper typos #412

Merged
merged 3 commits into from
Aug 15, 2024
Merged

Update paper typos #412

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
3090fb0
WIP
enricozb Aug 14, 2024
2f06447
Merge branch 'main' into enricozb/paper
enricozb Aug 14, 2024
4b534f8
memory layout typos
enricozb Aug 15, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file modified paper/HVM2.pdf
View file
Open in desktop
Binary file not shown.
6 changes: 3 additions & 3 deletions paper/HVM2.typst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -806,15 +806,15 @@ In HVM2's memory, it would be represented as:
```
RBAG | FST-TREE | SND-TREE
---- | -------- | --------
0800 | CON 0001 | CON 0002 // '& (b a) ~ (x (y *))'
0800 | CON 0002 | CON 0003 // '& (b a) ~ (x (y *))'
1800 | DUP 0005 | REF 0000 // '& {x y} ~ @foo'
---- | -------- | --------
NODE | PORT-1 | PORT-2
---- | -------- | --------
0001 | VAR 0000 | VAR 0001 // '(a b)' node (root)
0002 | VAR 0001 | VAR 0000 // '(b a)' node
0003 | VAR 0002 | CON 0004 // '(x (y *))' node
0004 | VAR 0003 | DUP 0000 // '(y *)' node
0004 | VAR 0003 | ERA 0000 // '(y *)' node
0005 | VAR 0003 | VAR 0002 // '{y x}' node
---- | -------- | --------
VARS | VALUE |
Expand Down Expand Up @@ -1185,7 +1185,7 @@ doesn't feature these yet.

For example, a single-core C program that adds numbers from 0 to a few billions
will easily outperform an HVM2 one that uses thousands of threads, given the C
version is doing no allocation, while C is allocating a tree-like recursive
version is doing no allocation, while HVM2 is allocating a tree-like recursive
stack. That said, not every program can be implemented as an allocation-free,
register-mutating loop. For real programs that allocate tons of short memory
objects, HVM2 is expected to perform extremely well.
Expand Down
Loading