Sciweavers

88 search results - page 1 / 18
» Synthetic Domain Theory in Type Theory: Another Logic of Com...
Sort
View
TPHOL
1996
IEEE
13 years 9 months ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
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...
Bernhard Reus
HOA
1993
13 years 9 months ago
Theory Interpretation in Simple Type Theory
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself...
William M. Farmer
LICS
1991
IEEE
13 years 8 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
BSL
2006
109views more  BSL 2006»
13 years 5 months ago
Computing with functionals - computability theory or computer science?
We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science hav...
Dag Normann
CIE
2005
Springer
13 years 10 months ago
Towards Computability of Higher Type Continuous Data
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
Margarita V. Korovina, Oleg V. Kudinov