Period
1991 - 2002
Number
5
Co-Authors
Autarkic computations in formal proofs (2002)
Barendregt, H.P., Barendsen, E.
Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (1996)
Bezem, M., Barendsen, E.
Uniqueness type inference (1995)
Smetsers, S., Barendsen, E.
Bar recursion versus polymorphism (1992)
Barendsen, E., Bezem, M.A.
By constructing a counter, model we show that a certain appealing equation E has no solution in Girard's [1972] second order lambdacalculus (the so-called polymorphic, lambda calculus). The equation...
Bar recursion versus polymorphism : extended abstract (1991)