We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
BSTRACTION, FUNCTION VARIABLES, AND SIMPLE UNIFICATION: Abstract Draft, 20 September 1989 Dale Miller Department of Computer and Information Science University of Pennsylvania Phil...