summaryrefslogtreecommitdiff
path: root/src
AgeCommit message (Collapse)Author
2023-07-03Add ability to compile terms to scheme.Chloe Brown
2023-07-03Add literals as primitive term.Chloe Brown
2023-06-22Add encodings for containers.Chloe Brown
Remove useless junk.
2023-06-21Add sums, vectors and arithmetic encodings.Chloe Brown
Also define pretty printing of terms.
2023-06-16Define semantics and encode types up to pairs.Chloe Brown
2023-06-16Reset using only co-de Bruijn syntax.Chloe Brown
2023-06-09Use co-deBruijn syntax in logical relation proof.masterChloe Brown
Many proofs are still missing. Because they are erased, the program still runs fine without them.
2023-06-08Use CoDebruijn syntax at top level.Chloe Brown
2023-06-08Fully expand thinnings.Chloe Brown
This makes adding CoDebruijn syntax simpler. If carrying the lengths of contexts around is too inefficient, I can always switch back to truncated thinnings.
2023-06-06Add a pretty printer.Chloe Brown
2023-06-06Write an encoding for data types.Chloe Brown
2023-06-01Give a logical relation template.Chloe Brown
2023-06-01Define terms with substitution as an operation.Chloe Brown
2023-06-01Add some properties of thinnings.Chloe Brown
2023-05-24Give a defunctionalised fuel-powered interpreter.Chloe Brown
2023-05-24Make normal forms a property.Chloe Brown
Weakening is now part of eval.
2023-05-24Make things less disgusting.Chloe Brown
2023-05-23Merge mutual definitions into a single function.Chloe Brown
This is really bad style, but a useful step in making a fuel-powered stack-based interpreter.
2023-05-23Use the continuation monad.Chloe Brown
2023-05-23Define a partial evaluator inductively.Chloe Brown
2023-05-23Define terms and thinnings.Chloe Brown