We study the position of the Automath systems within the framework of Pure Type Systems (PTSs). In [2, 22], a rough relationship has been given between Automath and PTSs. That relationship ignores three of the most important features of Automath: definitions, parameters and -reduction, because at the time, formulations of PTSs did not have these features. Since, PTSs have been extended with these features and in view of this, we revisit the correspondence between Automath and PTSs. This paper gives the most accurate description of Automath as a PTS so far.
|Title of host publication||Thirty Five Years of Automating Mathematics|
|Place of Publication||Dordrecht|
|Publisher||Kluwer Academic Publishers|
|Publication status||Published - 2003|
|Name||Applied Logic Series|