The calculus of dependent lambda eliminations

@article{Stump2017TheCO,
  title={The calculus of dependent lambda eliminations},
  author={Aaron Stump},
  journal={J. Funct. Program.},
  year={2017},
  volume={27},
  pages={e14}
}
Modern constructive type theory is based on pure dependently typed lambda calculus, augmented with user-defined datatypes. This paper presents an alternative called the Calculus of Dependent Lambda Eliminations, based on pure lambda encodings with no auxiliary datatype system. New typing constructs are defined which enable induction, as well as large eliminations with lambda encodings. These constructs are constructor-constrained recursive types, and a lifting operation to lift simply typed… CONTINUE READING

Similar Papers

Loading similar papers…