Rob Rix
|
7443cde497
|
Define ForEach statements.
|
2017-03-26 22:01:01 -04:00 |
|
Rob Rix
|
e2bf093178
|
Define For statements.
|
2017-03-26 22:00:52 -04:00 |
|
Rob Rix
|
d5aa1d3c7e
|
Note an alternative definition of If to decide on.
|
2017-03-26 21:18:07 -04:00 |
|
Rob Rix
|
8e9cc1607d
|
Rename the If syntax selectors.
|
2017-03-26 21:17:02 -04:00 |
|
Rob Rix
|
6b1d830e0f
|
Define DoWhile syntax.
|
2017-03-26 21:16:01 -04:00 |
|
Rob Rix
|
80ae9ffe4b
|
Define While syntax.
|
2017-03-26 21:15:10 -04:00 |
|
Rob Rix
|
cdd3ae18c8
|
Define Try/Catch/Finally statements.
Try in particular should suffice to define the same statements for e.g. Ruby (which adds Else to the typical Catch/Finally).
|
2017-03-26 21:12:47 -04:00 |
|
Rob Rix
|
d025a2aa44
|
Generalize Data.Functor.Union to (k -> *) -> k -> *.
|
2017-03-26 20:39:26 -04:00 |
|
Rob Rix
|
64a2523d1c
|
Define Throw syntax.
|
2017-03-26 18:41:39 -04:00 |
|
Rob Rix
|
574b4eba28
|
Define Return and Yield syntaxes.
|
2017-03-26 18:39:35 -04:00 |
|
Rob Rix
|
b13fc0432f
|
Superset is poly-kinded, and takes a constraint combinator.
This means that Superset can be used with Data.Record as well as Union.
|
2017-03-26 18:29:11 -04:00 |
|
Rob Rix
|
497e7e5c99
|
Define a superset constraint family for easier construction of unions.
|
2017-03-26 18:26:34 -04:00 |
|
Rob Rix
|
2ab72ea378
|
Define a convenience to unwrap and project.
|
2017-03-26 18:03:27 -04:00 |
|
Rob Rix
|
76218f1b9f
|
Define a convenience to embed-and-wrap.
|
2017-03-26 18:01:29 -04:00 |
|
Rob Rix
|
4dfcbc8257
|
Define Boolean literals.
|
2017-03-26 17:49:53 -04:00 |
|
Rob Rix
|
38803a47ce
|
Rename the StringLiteral selector.
|
2017-03-26 17:48:22 -04:00 |
|
Rob Rix
|
e178120950
|
Define If statements.
|
2017-03-26 17:44:27 -04:00 |
|
Rob Rix
|
17c33488f8
|
Stub in a module for declarations.
|
2017-03-26 17:31:50 -04:00 |
|
Rob Rix
|
c626f372ed
|
Stub in a module for declarations.
|
2017-03-26 17:31:10 -04:00 |
|
Rob Rix
|
833cbe5141
|
Note some literals to add.
|
2017-03-26 16:02:03 -04:00 |
|
Rob Rix
|
d2f08c0f64
|
Define integer literals without any particular base.
|
2017-03-26 15:59:52 -04:00 |
|
Rob Rix
|
3e5b86ac6c
|
Rename the symbol content selector.
|
2017-03-26 15:59:11 -04:00 |
|
Rob Rix
|
2add56eca4
|
Note some remaining ontological work.
|
2017-03-26 15:59:00 -04:00 |
|
Rob Rix
|
f918ec48b3
|
Clarify what kind of comment we’re talking about.
|
2017-03-26 15:56:58 -04:00 |
|
Rob Rix
|
33cd1e9aea
|
Define array and hash literals.
|
2017-03-26 15:37:12 -04:00 |
|
Rob Rix
|
28cfac7694
|
Define a Comment syntax type.
|
2017-03-26 15:35:09 -04:00 |
|
Rob Rix
|
8b2ac42788
|
Stub in a module for comment syntax.
|
2017-03-26 15:34:44 -04:00 |
|
Rob Rix
|
a7b8ca680c
|
Define symbol literals.
|
2017-03-26 15:32:58 -04:00 |
|
Rob Rix
|
21e9d7093b
|
Define (possibly interpolated) string literals.
|
2017-03-26 15:32:48 -04:00 |
|
Rob Rix
|
0d969f682c
|
Stub in a module to hold types for literal syntax, e.g. array/string/object/hash/symbol/number literals.
|
2017-03-26 15:30:33 -04:00 |
|
Rob Rix
|
779256e934
|
Define undifferentiated leaf/branch types.
|
2017-03-26 12:10:36 -04:00 |
|
Rob Rix
|
4d10edaf9a
|
Define a Show instance over Unions.
|
2017-03-26 12:09:15 -04:00 |
|
Rob Rix
|
28caa26d48
|
Define an Eq instance over Unions.
|
2017-03-26 12:09:09 -04:00 |
|
Rob Rix
|
7623df365c
|
Define instances of InUnion to select the correct element from the list of type constructors.
|
2017-03-26 12:08:00 -04:00 |
|
Rob Rix
|
9486b80efc
|
Define a typeclass to embed/project elements into/out of a Union.
|
2017-03-26 12:06:57 -04:00 |
|
Rob Rix
|
df3c26f17b
|
Define an n-ary union of type-constructors.
|
2017-03-26 12:06:05 -04:00 |
|
Rob Rix
|
f480bd5ad7
|
Stub in a module for an n-ary union of type constructors.
|
2017-03-26 12:05:49 -04:00 |
|
Rob Rix
|
8a5a1dc178
|
Stub in a module for à la carte Syntax.
|
2017-03-26 12:02:40 -04:00 |
|
Rob Rix
|
ae114c2023
|
Merge pull request #1049 from github/custom-setup-stanza
Custom setup stanza
|
2017-03-24 14:30:30 -04:00 |
|
Rob Rix
|
e507750069
|
Merge branch 'master' into custom-setup-stanza
|
2017-03-24 14:26:25 -04:00 |
|
Rob Rix
|
682032aeb9
|
Merge pull request #1038 from github/myers-algorithm-in-proof-refinement-style
Myers’ algorithm in proof refinement style
|
2017-03-24 14:21:18 -04:00 |
|
Rob Rix
|
e5f018c619
|
Just say State.
|
2017-03-24 14:13:41 -04:00 |
|
Rob Rix
|
66706c31de
|
🔥 diffAt, Cost, &c.
|
2017-03-24 14:12:14 -04:00 |
|
Rob Rix
|
fedacdc7d5
|
🔥 continue.
|
2017-03-24 14:06:57 -04:00 |
|
Timothy Clem
|
c807c8271b
|
++haskell-tree-sitter to have custom setup stanza
|
2017-03-24 10:43:43 -07:00 |
|
Timothy Clem
|
c66631cfa6
|
Add custom-setup stanza to fix build warnings
|
2017-03-24 10:43:23 -07:00 |
|
Rob Rix
|
2a1fb5ad36
|
Partially apply decompose.
|
2017-03-23 16:39:57 -04:00 |
|
Rob Rix
|
f8b3d1490b
|
Index the state array by Diagonal.
|
2017-03-23 15:57:13 -04:00 |
|
Rob Rix
|
973d873297
|
Derive an instance of Ix for Diagonal.
|
2017-03-23 15:54:46 -04:00 |
|
Rob Rix
|
6ca3d56269
|
Derive an Ord instance for Diagonal.
|
2017-03-23 15:52:13 -04:00 |
|