Repository logo
 
Loading...
Thumbnail Image
Publication

The computational content of atomic polymorphism

Use this identifier to reference this record.
Name:Description:Size:Format: 
Fat computational content.pdf435.86 KBAdobe PDF Download

Advisor(s)

Abstract(s)

We show that the number-theoretic functions de nable in the atomic polymorphic system (Fat) are exactly the extended polynomials. Two proofs of the above result are presented: one reducing the functions' de n- ability problem in Fat to de nability in the simply typed lambda-calculus and other directly adapting Helmut Schwichtenberg's strategy for de nability in the simply typed lambda-calculus to the atomic polymorphic setting. The uniformity granted in the polymorphic system, when compared with the simply typed lambda-calculus, is emphasized.

Description

Keywords

Predicative polymorphism Representable functions Lambda-calculus Normalization Beta-equality Extended polynomials

Pedagogical Context

Citation

Organizational Units

Journal Issue