diff --git a/index.html b/index.html index b0ed37b..7c8936b 100644 --- a/index.html +++ b/index.html @@ -1,4 +1,3 @@ - @@ -7,23 +6,42 @@ Harmony Programming Language - + - + - - - - - - - + + + + + + + @@ -98,7 +116,8 @@

Now available for Visual Studi - + @@ -124,9 +143,11 @@

Now available for Visual Studi

Documentation

Start Here

- +
-

The Harmony Online Textbook

+ +

The Harmony Online Textbook

+

A Comprehensive Introduction to Concurrent Programming
@@ -135,22 +156,30 @@

Documentation

-

Installing Harmony

+ +

Installing Harmony

+

A Quick Start Guide

-

Language Reference

+ +

Language Reference

+

Language features and syntax

-

Library Reference

+ +

Library Reference

+

Built in modules and libraries

-

What's New in Harmony?

+ +

What's New in Harmony?

+

Changelog & Patch Notes

@@ -195,7 +224,8 @@

HarmonyLang for VSCode

  • Automatic Compiler Installation
  • - Download + Download
    @@ -218,18 +248,23 @@

    Examples

    -

    Dining Philosophers

    +

    Dining + Philosophers

    - Formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals. + Formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers + competing for access to tape drive peripherals.

    -

    Peterson's Algorithm

    +

    Peterson's Algorithm +

    - An algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication. + An algorithm for mutual exclusion that allows two or more processes to share a single-use resource + without conflict, using only shared memory for communication.

    @@ -237,16 +272,19 @@

    -

    Hoare Monitor

    +

    Hoare + Monitor

    - A synchronization construct that allows threads to have both mutual exclusion and the ability to wait (block) for a certain condition to become false. + A synchronization construct that allows threads to have both mutual exclusion and the ability to wait + (block) for a certain condition to become false.

    -

    Reader/Writer Problem

    +

    Reader/Writer + Problem

    One of the most common problems in concurrency, we want to prevent more than one thread modifying the shared resource simultaneously and allow for two or more readers to access the shared resource @@ -258,7 +296,8 @@

    -

    Banking

    +

    Banking +

    It would make for quite a poor banking experience to allow dollars to simply go missing or be created from thin air, however that's exactly what might happen with poorly designed concurrent programs. @@ -268,9 +307,10 @@

    -

    Split Binary Semaphores

    +

    Split + Binary Semaphores

    - A technique originally discovered, but not recommended by, Tony Hoare. + A technique originally discovered, but not recommended by, Tony Hoare. It uses a set of binary semaphores the sum of which never exceeds 1

    @@ -303,8 +343,9 @@

    About

    - Learning programming in Harmony should be straightforward to those familiar with Python or similar languages. - In addition to our online documentation, we provide a textbook in PDF form with many programming examples + Learning programming in Harmony should be straightforward to those familiar with Python or similar + languages. + In addition to our online documentation, we provide a textbook in PDF form with many programming examples including Peterson's Algorithm, reader/writer locks, and split binary semaphores.

    Read more @@ -428,14 +469,6 @@

    Renyu Li

    - -

    - -
    -

    Past Team Members

    -
    - -
    @@ -453,7 +486,6 @@

    Shi Chong Zhao

    -
    @@ -516,17 +548,31 @@

    Harmony

    - - - - - - - + + + + + + + - + \ No newline at end of file