Link to AoC problem in day module
This commit is contained in:
parent
d405c43683
commit
b0882a899e
|
@ -1,8 +1,8 @@
|
||||||
# Advent
|
# Advent
|
||||||
|
|
||||||
The goal of this project is to get all 500 currently available stars in the form
|
The goal of this project is to get all 500 currently available stars in the form
|
||||||
of one single idris application, and thoroughly document the results as literate
|
of one single Idris application, and thoroughly document the results as literate
|
||||||
idris files.
|
Idris files.
|
||||||
|
|
||||||
# Index of non-day modules
|
# Index of non-day modules
|
||||||
|
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 1
|
# [Year 2015 Day 1](https://adventofcode.com/2015/day/1)
|
||||||
|
|
||||||
Pretty simple, basic warmup problem, nothing really novel is on display here
|
Pretty simple, basic warmup problem, nothing really novel is on display here
|
||||||
except the effectful part computations.
|
except the effectful part computations.
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 10
|
# [Year 2015 Day 10](https://adventofcode.com/2015/day/10)
|
||||||
|
|
||||||
This day doesn't really add anything new, but we will show off our new views for
|
This day doesn't really add anything new, but we will show off our new views for
|
||||||
viewing integers as lists of digits.
|
viewing integers as lists of digits.
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 11
|
# [Year 2015 Day 11](https://adventofcode.com/2015/day/11)
|
||||||
|
|
||||||
This day provides a gentle introduction to refinement types, types which augment
|
This day provides a gentle introduction to refinement types, types which augment
|
||||||
other types with a predicate that must hold for all the values of the refined
|
other types with a predicate that must hold for all the values of the refined
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 2
|
# [Year 2015 Day 2](https://adventofcode.com/2015/day/2)
|
||||||
|
|
||||||
This day provides us our first little taste of effectful parsing
|
This day provides us our first little taste of effectful parsing
|
||||||
|
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 3
|
# [Year 2015 Day 3](https://adventofcode.com/2015/day/3)
|
||||||
|
|
||||||
This day provides a gentle introduction to `mutual` blocks and mutually
|
This day provides a gentle introduction to `mutual` blocks and mutually
|
||||||
recursive functions.
|
recursive functions.
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 4
|
# [Year 2015 Day 4](https://adventofcode.com/2015/day/4)
|
||||||
|
|
||||||
This day introduces us to a little bit of FFI, linking to openssl to use it's
|
This day introduces us to a little bit of FFI, linking to openssl to use it's
|
||||||
`MD5` functionality.
|
`MD5` functionality.
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 5
|
# [Year 2015 Day 5](https://adventofcode.com/2015/day/5)
|
||||||
|
|
||||||
This day provides a nice chance to introduce
|
This day provides a nice chance to introduce
|
||||||
[views](https://idris2.readthedocs.io/en/latest/tutorial/views.html),
|
[views](https://idris2.readthedocs.io/en/latest/tutorial/views.html),
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 6
|
# [Year 2015 Day 6](https://adventofcode.com/2015/day/6)
|
||||||
|
|
||||||
<!-- idris
|
<!-- idris
|
||||||
module Years.Y2015.Day6
|
module Years.Y2015.Day6
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 7
|
# [Year 2015 Day 7](https://adventofcode.com/2015/day/7)
|
||||||
|
|
||||||
This day provides us a gentle introduction to dependent maps.
|
This day provides us a gentle introduction to dependent maps.
|
||||||
|
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 8
|
# [Year 2015 Day 8](https://adventofcode.com/2015/day/8)
|
||||||
|
|
||||||
This day provides a more in depth introduction to writing effectful parsers,
|
This day provides a more in depth introduction to writing effectful parsers,
|
||||||
making use of state and non-determinism in our parsers.
|
making use of state and non-determinism in our parsers.
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
# Year 2015 Day 9
|
# [Year 2015 Day 9](https://adventofcode.com/2015/day/9)
|
||||||
|
|
||||||
This day provides our first example of a graph traversal problem. We'll use a
|
This day provides our first example of a graph traversal problem. We'll use a
|
||||||
`Choose` based effectful breath first search to identify all the possible paths
|
`Choose` based effectful breath first search to identify all the possible paths
|
||||||
|
|
Loading…
Reference in a new issue