Equivalences between pure type systems and systems of illative combinatory logic (Q2565990)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2210070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalences between pure type systems and systems of illative combinatory logic |
scientific article; zbMATH DE number 2210070 |
Statements
Equivalences between pure type systems and systems of illative combinatory logic (English)
0 references
28 September 2005
0 references
In continuation of the paper [``Pure type systems with more liberal rules'', J. Symb. Log. 66, No. 4, 1561--1580 (2001; Zbl 0997.03014)], the authors introduce Systems of Illative Combinatory Logic equivalent to the four Pure Type Systems PTS, APTS, SPTS, and SAPTS, introduced in the paper mentioned above. Properties of the Systems of Illative Combinatory Logic as well as the equivalences are proven in full detail.
0 references
pure type systems
0 references
illative combinatory logic
0 references
0 references
0 references
0.91932803
0 references
0.9078374
0 references
0 references
0.9027465
0 references
0.8957889
0 references
0.8957889
0 references
0.8934789
0 references
