blob: d07ddbd86e08f463866b7f8cd7fc995c9a8948cd (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
parser:
./a%20b
./"a%20b"
text interpolation and escapes
projection by expression unit tests
x.({ a : Bool, b })
x.({ a })
x.{ a : Bool }
s/QuotedVariable/VariableQuoted/
From https://github.com/dhall-lang/dhall-lang/issues/280 :
"${ not_really_an_expression ;-) }"
''${ not_an_expression ;-) }''
{- {- -} 1
import:
failure/
don't recover cycle
don't resolve symlinks in canonicalizing
normalization:
move builtins and operators in their own folder ?
RecordSortFields { b = 1, a = 0 }
RecordTypeSortFields { b : Bool, a : Natural }
type-inference:
something that involves destructuring a recordtype after merge
add some of the more complicated Prelude tests back, like List/enumerate
failure/
\(_: Bool) -> assert : (\(_: Bool) -> _) === (\(x: Bool) -> _)
merge { x = λ(x : Bool) → x } (< x: Bool | y: Natural >.x True)
merge { x = λ(_ : Bool) → _, y = 1 } < x = True | y >
merge { x = True, y = 1 } < x | y >.x
merge {x=...,y=...} <x>.x
merge {x=...,y=...} <x:T>.x
equivalence:
|
