16430 search results - page 102 / 3286 » On Computable Tree Functions |
118
click to vote
CIE
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to t...
152
Voted
POPL
1997
ACM
15 years 7 months ago
1997
ACM
We propose a new computation model which combines the operational principles of functional languages (reduction), logic languages (non-deterministic search for solutions), and int...
107
click to vote
ARITH
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper we design a CORDIC architecture for variable
101
click to vote
AISC
2008
Springer
15 years 5 months ago
2008
Springer
This paper discusses the pros and cons of using a functional language for implementing a computer algebra system. The contributions of the paper are twofold. Firstly, we discuss so...
138
click to vote
WG
1999
Springer
15 years 7 months ago
1999
Springer
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...