MoL-2016-11: Marzion, Evan (2016) Closed Sets of Higher-Order Functions. [Report]
Preview |
Text (Full Text)
MoL-2016-11.text.pdf Download (623kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
MoL-2016-11.abstract.txt Download (816B) |
Abstract
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 |
| URI: | https://eprints.illc.uva.nl/id/eprint/983 |
Actions (login required)
 |
View Item |
