made simple_example prove recursion of bui

ld system

Author: kiahjh

examples/simple_example/main.lv

@@ -1,5 +1,6 @@
-use math#(two)
+use numbers#(two, three)
+use math#(add, increment)
 
 main :: fun () -> Int: {
-   2 + two
+   add(two, to: increment(three))
 }

examples/simple_example/math.lv

@@ -1 +1,4 @@
-two :: 2
+use numbers#(one)
+
+add :: fun (x: Int, to y: Int) -> Int: x + y
+increment :: fun (x: Int) -> Int: x + one

examples/simple_example/numbers.lv

@@ -0,0 +1,3 @@
+one :: 1
+two :: 2
+three :: 3

src/blush/combiner.rs

@@ -1,5 +1,4 @@
 use crate::{
-    blush::printer,
     parser::ast::{Expression, ExpressionKind, Program, UseTailItem},
     span::Span,
 };
@@ -19,7 +18,6 @@ impl<'a> Combiner<'a> {
     }
 
     pub fn combine(self) -> Result<Program, Box<dyn Error>> {
-        printer::info(&format!("Combining {} ASTs...", self.files.len()));
         let Some(main_file) = self
             .files
             .iter()

src/blush/mod.rs

@@ -22,7 +22,6 @@ impl Blush {
         let path_buf = PathBuf::from(path);
         let file_tree = collect_files(&path_buf)?;
 
-        printer::info("Reading config file...");
         let Some(config_file) = file_tree.find(&|name, _| {
             name.split('/')
                 .next_back()
@@ -46,7 +45,6 @@ impl Blush {
             })
             .expect("Expected a directory");
 
-        printer::info(&format!("Parsing {} files...", lovely_files.len()));
         let parsed_lovely_files =
             lovely_files.try_map(&|s| Parser::new(s).parse().map_err(std::convert::Into::into))?;
         let flattened_files: Vec<(String, &_)> = parsed_lovely_files