MoL-2016-11: Closed Sets of Higher-Order Functions

MoL-2016-11: Marzion, Evan (2016) Closed Sets of Higher-Order Functions. [Report]

[thumbnail of Full Text]
Text (Full Text)

Download (623kB) | Preview
[thumbnail of Abstract] Text (Abstract)

Download (816B)


In universal algebra, clones may be viewed as a way of studying definability between functions within the presence of certain natural operations, namely projection and composition. We show how the simply typed lambda calculus provides a suitable framework for extending this study to higher-order functions as well. We define what we call a combinatory clone, a higher-order analogue of regular clones, and establish some basic results about them. Inspired by Post’s classification of the boolean clones, boolean combinatory clones are studied. Finally, we consider an extension of the simply typed lambda calculus with product types, and show how they do not affect anything from the point of view of combinatory clones.

Item Type: Report
Report Nr: MoL-2016-11
Series Name: Master of Logic Thesis (MoL) Series
Year: 2016
Uncontrolled Keywords: logic, mathematics
Subjects: Logic
Date Deposited: 12 Oct 2016 14:39
Last Modified: 12 Oct 2016 14:39

Actions (login required)

View Item View Item