https://github.com/chrispenner/candor
A toy Parser+Compiler+Typechecker
https://github.com/chrispenner/candor
Last synced: about 2 months ago
JSON representation
A toy Parser+Compiler+Typechecker
- Host: GitHub
- URL: https://github.com/chrispenner/candor
- Owner: ChrisPenner
- License: bsd-3-clause
- Created: 2018-02-11T20:15:28.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2023-02-15T05:24:55.000Z (over 2 years ago)
- Last Synced: 2025-03-21T20:46:37.833Z (2 months ago)
- Language: Haskell
- Size: 116 KB
- Stars: 12
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: ChangeLog.md
- License: LICENSE
Awesome Lists containing this project
README
# Candor
A toy language I'm writing to learn more about parsing, compiling, typechecking
and type inference. It's a simple lisp-like expression-based language.
Usage:
- `stack build && stack exec candor-exe -- ./my-prog.cndr`
```lisp
;; It uses prefix notation for function application
;; Variadic functions are not yet supported
(+ 1 2)
;; 3
(++ "hello, " "world!")
;; hello, world!
;; You can define lambdas using `{[args] expr}` syntax
({[num] (* num num)} 5)
;; 25
;; `=` creates a binding between a symbol and an expression.
;; You then call the binding as though it's a function to bring its bindings into scope:
(
(= square {[num] (* num num)})
(square 5)
)
;; 25
;; `merge` a list of bindings into a set of bindings
(
(merge [ (= x 10)
(= y 42)
(= square {[num] (* num num) })])
(+ (square x) y)
)
)
;; 142
```
Here's a recursive factorial function:
```lisp
(
(= fact
{[num]
(if (== num 0)
1
(* num (fact (- num 1))))}
)
(fact 0)
)
```
Currently unsupported:
- [x] ~~Recursion~~
- [x] Type inference
- [ ] IO
- [ ] Datatypes
Like seriously, don't even try and use this thing.