JavaScript is disabled for your browser. Some features of this site may not work without it.
Computability on Continuous Higher Types and its Role in the Semantics of Programming Languages

Author
Constable, Robert L.; Egli, Herbert
Abstract
This paper is about mathematical problems in programming language semantics and their influence on recursive function theory. In the process if constructing computable Scott models of the lambda calculus we examine the concepts of deterministic and non-deterministic effective operators of all finite types and continuous deterministic and non-deterministic partial computable operators on continuous inputs of all finite types. These are new recursion theoretic concepts which are appropriate to semantics and were inspired in part by Scott's work on continuity.
Date Issued
1974-07Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-209
Type
technical report