Partial Combinatory Algebras of Functions

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

Jaap Van Oosten
Leiden University
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
Keywords sequential function   partial combinatory algebra   preorder enriched category
Categories (categorize this paper)
DOI 10.1215/00294527-1499381
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 39,626
Through your library

References found in this work BETA

A General Form of Relative Recursion.Jaap van Oosten - 2006 - Notre Dame Journal of Formal Logic 47 (3):311-318.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
37 ( #203,143 of 2,325,929 )

Recent downloads (6 months)
11 ( #94,974 of 2,325,929 )

How can I increase my downloads?


My notes

Sign in to use this feature