36de7f9 · urbit.org · git.iko.soy

git.iko.soy/urbit.org

on master help sign in

various minor fixes

36de7f9joshuareagan8 years ago

docs/tutorials/gall.umd+1−1

compare with master

unifiedsplit

@@ -9,6 +9,6 @@

10This is documentation about how to write Gall apps. Some knowledge of Hoon is assumed.

12−Note: these lessons were first written in 2016. They need to be rewritten; in some ways they are outdated, and in other ways they were not always accessible enough to beginners. We are planning to rewrite these in the near future. In the meantime there is still useful information to be found here.

12+> Note: the last major revision of these lessons was in 2016. They need to be rewritten; in some ways they are outdated, and in other ways they were not always accessible enough to beginners. We are planning to rewrite these in the near future. In the meantime there is still useful information to be found.

14;list;

docs/tutorials/hall.umd+2

@@ -8,6 +8,8 @@

9# Hall

11+> Last major revision of this tutorial: 2017. Some of the information here may be outdated.

12+

11Hall is the Urbit messaging and notifications protocol. Read up on Hall's

13Hall is the Urbit messaging and notifications protocol. Read up on Hall's

12architecture, its interfaces and the new Gall model it's built to target.

14architecture, its interfaces and the new Gall model it's built to target.

docs/tutorials/hoon-ch1.umd+2

@@ -7,6 +7,8 @@

8# Chapter 1: Fundamental Concepts of Subject-oriented Programming

10+> Last major revision of this tutorial: September 2018

11+

10Hoon is a high-level, statically typed, functional programming language, custom-designed for use with Urbit. For a functional language it has a surprisingly imperative style, and mastering it doesn't require knowing any advanced mathematics.

12Hoon is a high-level, statically typed, functional programming language, custom-designed for use with Urbit. For a functional language it has a surprisingly imperative style, and mastering it doesn't require knowing any advanced mathematics.

12Hoon is an unusual language in several respects, both in syntax and semantics. It uses runes (i.e., ASCII digraphs) in place of keywords, and the spacing rules are a bit strict. A great deal can be expressed in few lines, though excessively compressed code tends to be hard to read. Hoon has surprisingly simple semantics, but mastering it requires learning concepts that don't have close analogues in other languages.

14Hoon is an unusual language in several respects, both in syntax and semantics. It uses runes (i.e., ASCII digraphs) in place of keywords, and the spacing rules are a bit strict. A great deal can be expressed in few lines, though excessively compressed code tends to be hard to read. Hoon has surprisingly simple semantics, but mastering it requires learning concepts that don't have close analogues in other languages.

docs/tutorials/hoon-ch2.umd+2

@@ -7,6 +7,8 @@

8# Chapter 2: Introduction to Writing Hoon Programs

10+> Last major revision of this tutorial: September 2018

11+

10In Chapter 2 we cover the basics of writing full programs in Hoon.

12In Chapter 2 we cover the basics of writing full programs in Hoon.

12Lesson 1 takes you through a simple Hoon program without explaining every detail. Lesson 2 covers Hoon's syntax rules. Lesson 3 covers some of the basic flow control and loop expressions. Lessons 4-6 introduce Hoon's type system. Lessons 7 and 8 show you how to use cores effectively in your Hoon programs, including how to use them as state machines. Lessons 9 and 10 cover some of the basic data structures commonly used in Hoon, such as lists, trees, and sets. Those lessons also introduce many of the standard library functions for use with those data structures. Lesson 11 includes a walk-through of two Hoon programs that are intended to reinforce everything taught earlier in the chapter: a prime sieve and a tic-tac-toe program.

14Lesson 1 takes you through a simple Hoon program without explaining every detail. Lesson 2 covers Hoon's syntax rules. Lesson 3 covers some of the basic flow control and loop expressions. Lessons 4-6 introduce Hoon's type system. Lessons 7 and 8 show you how to use cores effectively in your Hoon programs, including how to use them as state machines. Lessons 9 and 10 cover some of the basic data structures commonly used in Hoon, such as lists, trees, and sets. Those lessons also introduce many of the standard library functions for use with those data structures. Lesson 11 includes a walk-through of two Hoon programs that are intended to reinforce everything taught earlier in the chapter: a prime sieve and a tic-tac-toe program.

docs/tutorials/internals.umd+1−2

@@ -7,8 +7,7 @@

8# Arvo internals

10−Note: The following documentation was written in 2016. It needs to be rewritten: it's outdated in some respects, and it's also not always as clear as it could be. A rewrite is planned at some point. There is still good information to be found here, but don't bet the farm on anything you read in this section.

10+> Note: The last major revision of these sections was in 2016. They need to be rewritten: they're outdated in some respects, and also not always as clear as they could be. A rewrite is planned. There is still plenty of good information to be found, but don't bet the farm on anything you read here.

11−

13Arvo is composed of modules called vanes:

12Arvo is composed of modules called vanes:

docs/tutorials/nock.umd+2

@@ -7,6 +7,8 @@

8# Nock

10+> Last major revision of this tutorial: 2016

11+

10Nock is the low-level functional programming language that is interpreted by Vere. You don't need to know Nock to write Hoon, or even to work on most parts of Vere. But if you want to understand the foundations of Urbit and are mathematically-inclined, dive right in.

12Nock is the low-level functional programming language that is interpreted by Vere. You don't need to know Nock to write Hoon, or even to work on most parts of Vere. But if you want to understand the foundations of Urbit and are mathematically-inclined, dive right in.

12;list;

14;list;

docs/tutorials/sail.umd+1−1

@@ -1,7 +1,7 @@

1:- :~ navhome/'/docs/'

2 sort/'4'

3 next/'true'

4− title/'Introduction to Sail'

4+ title/'Sail'

5 ==

6;>