Types of Par nodes.

The different Par modes are indicated by bracket types.

Inverse of par_mode_brackets

Tempo is rational. The duration of a Term is the reciprocal of the Tempo that is in place at the Term.

Terms are the leaf nodes of the temporal structure.

Value of Term, else Nothing

Recursive temporal structure.

Given a Par mode, generate either: 1. an Iso, 2. a Par, 3. a series of nested Par.

Pretty printer for Bel, given pretty printer for the term type. Note this does not write nested Par nodes in their simplified form.

bel_pp of return.

Analyse a Par node giving (duration,LHS-tempo-*,RHS-tempo-*).

par_analyse 1 Par_Left (nseq "cd") (nseq "efg") == (2,1,3/2)
par_analyse 1 Par_Right (nseq "cd") (nseq "efg") == (3,2/3,1)
par_analyse 1 Par_Min (nseq "cd") (nseq "efg") == (2,1,3/2)
par_analyse 1 Par_Max (nseq "cd") (nseq "efg") == (3,2/3,1)
par_analyse 1 Par_None (nseq "cd") (nseq "efg") == (3,1,1)

Duration element of par_analyse.

Calculate final tempo and duration of Bel.

snd of bel_tdur.

Time point.

Voices are named as a sequence of left and right directions within nested Par structures. l is left and r is right.

Linear state. Time is the start time of the term. Tempo is the active tempo & therefore the reciprocal of the duration. Voice is the part label.

Linear term.

Start time of L_Term.

Duration of L_Term (reciprocal of tempo).

End time of L_Term.

Voice of L_Term.

Term of L_Term

Value of Term of L_Term

Linear form of Bel, an ascending sequence of L_Term.

Linearise Bel given initial L_St, ascending by construction.

Merge two ascending L_Bel.

Set of unique Tempo at L_Bel.

Multiply Tempo by n, and divide Time by n.

The multiplier that will normalise an L_Bel value. After normalisation all start times and durations are integral.

Calculate and apply L_Bel normalisation multiplier.

All leftmost voices are re-written to the last non-left turning point.

map voice_normalise ["","l","ll","lll"] == replicate 4 ""
voice_normalise "lllrlrl" == "rlrl"

== on voice_normalise

Unique Voices at L_Bel.

The duration of L_Bel.

Locate an L_Term that is active at the indicated Time and in the indicated Voice.

Calculate grid (phase diagram) for L_Bel.

lbel_grid of bel_linearise.

Bel type phase diagram for Bel of Char. Optionally print whitespace between columns.

putStrLn of bel_ascii.

Infix form for Seq.

foldl1 of Seq.

lseq [Node Rest] == Node Rest
lseq [Node Rest,Node Continue] == Seq (Node Rest) (Node Continue)

Node of Value.

lseq of Node

Variant of nseq where _ is read as Continue and - as Rest.

Par of Par_Max, this is the default Par_Mode.

Node of Rest.

lseq of replicate of rest.

Verify that bel_char_pp of bel_char_parse is id.

Run bel_char_parse, and print both bel_char_pp and bel_ascii.

bel_ascii_pp "{i{ab,c[d,oh]e,sr{p,qr}},{jk,ghjkj}}"

Parse Rest Term.

P.parse p_rest "" "-"

Parse Rest Term.

P.parse p_nrests "" "3"

Parse Continue Term.

P.parse p_continue "" "_"

Parse Char Value Term.

P.parse p_char_value "" "a"

Parse Char Term.

P.parse (P.many1 p_char_term) "" "-_a"

Parse Char Node.

P.parse (P.many1 p_char_node) "" "-_a"

Parse non-negative Integer.

P.parse p_non_negative_integer "" "3"

Parse non-negative Rational.

P.parse (p_non_negative_rational `P.sepBy` (P.char ',')) "" "3%5,2/3"

Parse non-negative Double.

P.parse p_non_negative_double "" "3.5"
P.parse (p_non_negative_double `P.sepBy` (P.char ',')) "" "3.5,7.2,1.0"

Parse non-negative number as Rational.

P.parse (p_non_negative_number `P.sepBy` (P.char ',')) "" "7%2,3.5,3"

Parse Mul.

P.parse (P.many1 p_mul) "" "/3*3/2"

Given parser for Bel a, generate Iso parser.

p_iso of p_char_bel.

P.parse p_char_iso "" "{abcde}"

Given parser for Bel a, generate Par parser.

p_par of p_char_bel.

p = P.parse p_char_par ""
p "{ab,{c,de}}" == p "{ab,c,de}"
p "{ab,~(c,de)}"

Parse Bel Char.

P.parse (P.many1 p_char_bel) "" "-_a*3"

Run parser for Bel of Char.