yiyunliu/nbe-kripke-racket
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Update the README file

Browse source
This commit is contained in:
Yiyun Liu 2025-05-12 00:58:49 -04:00
parent cc59960e79
commit 814d5fa73d
1 changed files with 1 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

6
README.md
View file

@ -1,4 +1,4 @@
# Kripke-style untyped NbE in racket # untyped NbE in racket
[![status-badge](https://woodpecker.electriclam.com/api/badges/4/status.svg)](https://woodpecker.electriclam.com/repos/4) [![status-badge](https://woodpecker.electriclam.com/api/badges/4/status.svg)](https://woodpecker.electriclam.com/repos/4)
An implementation of normalization by evaluation loosely based on [A An implementation of normalization by evaluation loosely based on [A
@ -10,7 +10,3 @@ Since the implementation is untyped, the `normalize` function only
gives you β-normal forms. However, you can get a little bit of gives you β-normal forms. However, you can get a little bit of
βη-equivalence by invoking Coquand's algorithm (`η-eq?`) on βη-equivalence by invoking Coquand's algorithm (`η-eq?`) on
β-normal forms. β-normal forms.
I'm hoping to expand the repository into a benchmark suite where I can
visualize the performance trade-off of type-directed NbE compared to
untyped NbE composed with Coquand's algorithm.