376 search results - page 3 / 76 » Developing Theories of Types and Computability via Realizabi... |
JAPLL
2006
13 years 7 months ago
2006
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
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...
IFIP3
1998
13 years 8 months ago
1998
The concept of the Virtual University offers a new learning environment for distance education. All the functionalities of a conventional university are available to the students ...
ENTCS
2006
13 years 7 months ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...