An interpreted, statically typed, lazily evaluated functional programming language. Parakeet is an attempt to learn more about programming languages and interpreters.

Parakeet's goal is to be a language with pure functional features while remaining lightweight. Many purely functional languages are hindered by slow compilers and difficult syntax for programmers coming from popular programming languages in other paradigms. Parakeet is designed to be easily picked up by all programmers, whether it is their first functional language or not, while being a good tool for quick iteration.

Parakeet is available to run as a REPL application as well as interpret source files.

• compile: Compile the project
• test: Compile the project and run the test suite
• run: Compile the project and run the Parakeet REPL
• run /path/to/sourcefile: Compile the project and run the file located at /path/to/sourcefile
• clean: Deletes files created by SBT
• package: Produces a .jar artifact
• tasks: See other available tasks

• scalafmt: Scala formatter for the project
  • Formats source files in the style outlined in the project's .scalafmt.conf file

This section assumes you have a built version of Parakeet with the binary name parakeet

• parakeet: Launches the REPL
• parakeet /path/to/sourcefile: Compile the project and run the file located at /path/to/sourcefile

• AST Structure
• Numeric Evaluation
  • +, -, *, / operators
  • Modulus operator
  • Exponent operator
• Primitive String Evalution
• Start test suite for unit testing previously completed work
• Primitive Type Storage
• REPL storage between commands
• Error handling for Parsing and Runtime
• Source files
• Function Declaration
• Type Declaration
• Type Restriction
• Algebraic Data Type evalution
• String Data Type
• Entrypoint definition
• Lazy Evaluation
• Custom Data Type Storage
• Pattern Matching
• Robust Stacktraces for Error Handling
• Type Inference