Partial Combinatory Algebras of Functions

Notre Dame Journal of Formal Logic 52 (4):431-448 (2011)
  Copy   BIBTEX

Abstract

We employ the notions of "sequential function" and "interrogation" (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using Longley's preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results is that every realizability topos is a geometric quotient of a realizability topos on a total combinatory algebra

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,347

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2011-11-05

Downloads
71 (#232,616)

6 months
21 (#128,622)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jaap Van Oosten
Leiden University

Citations of this work

Third-order functionals on partial combinatory algebras.Jetze Zoethout - 2023 - Annals of Pure and Applied Logic 174 (2):103205.

Add more citations

References found in this work

Query.[author unknown] - 1989 - Newsletter of the Society for the Advancement of American Philosophy 17 (52):9-9.
A General Form of Relative Recursion.Jaap van Oosten - 2006 - Notre Dame Journal of Formal Logic 47 (3):311-318.

Add more references