Abstract
For several important systems of the λ-cube we study the time-complexity of type conversion.
Lower and upper bounds for reductions of types in λω and λP
DSpace/Manakin Repository
Lower and upper bounds for reductions of types in λω and λP
(1992) Logic Group Preprint Series, volume 83
(Preprint)
Download/Full Text
See more statistics about this item