https://github.com/thma/lispkit

Implementing a small functional language with a combinator graph reduction engine
https://github.com/thma/lispkit

combinator-graphs combinatory-logic eval functional-language graph-reduction lambda-calculus lambda-terms lispkit parallel-reduction repl ski-combinators

Last synced: 8 days ago
JSON representation

Implementing a small functional language with a combinator graph reduction engine

• Host: GitHub
• URL: https://github.com/thma/lispkit
• Owner: thma
• License: apache-2.0
• Created: 2019-11-11T16:31:31.000Z (almost 5 years ago)
• Default Branch: master
• Last Pushed: 2023-10-19T11:16:40.000Z (about 1 year ago)
• Last Synced: 2023-10-19T12:31:02.775Z (about 1 year ago)
• Topics: combinator-graphs, combinatory-logic, eval, functional-language, graph-reduction, lambda-calculus, lambda-terms, lispkit, parallel-reduction, repl, ski-combinators
• Language: Haskell
• Size: 92.8 KB
• Stars: 5
• Watchers: 4
• Forks: 0
• Open Issues: 3
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
[![Actions Status](https://github.com/thma/lispkit/workflows/Haskell%20CI/badge.svg)](https://github.com/thma/lispkit/actions)

# lispkit

Implementing a small functional language with a combinator graph reduction engine

## already implemented

- implement if based on bools 

- implement all lispkit primops

- have 'it' in the repl

- provide :l, :r and :q in repl

- add define to repl

- compile SEpxr to lambda terms

- build eval based on lambda terms

- eval can throw exceptions

- support closures with lexical / static scope

- write regression test suite

## todo list

- implement letrec in lambda term evaluator 

- compile lambda to SKI combinators

- write graph reduction for combinator graphs

- reimplement P combinator from my ancient webLisp