Closed mroman42 closed 7 years ago
Type inference on simply typed lambda calculus has been implemented in 04a9980758808c0324e74add81c3e73ea387bb1a
Simple proofs on IPL can be written on this implementation. 05dba8ad6 limits the expressions that can be executed on the simply-typed interpreter
Write an implementation of a simply typed lambda calculus interpreter and look forward to implement other type systems. A symply-typed Mikrokosmos could be used to check proofs on natural deduction (?)