We give a presentation of Pure type systems where contexts need not be well-formed and show that this presentation is equivalent to the usual one. The main motivation for this presentation is that, when we extend Pure type systems with computation rules, like in the logical framework Dedukti, we want to declare the constants before the computation rules that are needed to check the well-typedness of their type.
翻译:我们演示了纯类型系统,其中环境不需要完善,并表明这一表述与通常的相同。 本次表述的主要动机是,当我们扩展纯类型系统时,使用计算规则,比如逻辑框架Dedukti,我们要在计算规则之前宣布用于检查其类型类型类型是否精密所需的常数。