Roberto Di Cosmo and Delia Kesner.
A confluent reduction for the extensional typed λ-calculus
with pairs, sums, recursion and terminal object.
In Andrzej Lingas, editor, Intern. Conf. on Automata, Languages
and Programming (ICALP), volume 700 of Lecture Notes in Computer
Science, pages 645--656. Springer-Verlag, July 1993.
[ bib |
Local copy ]
This file was generated by