Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Primitive recursive functional

In mathematical logic, the primitive recursive functionals are a generalization of primitive recursive functions into higher type theory. They… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper we analyse an infimal convolution type regularisation functional called TVL∞, based on the total variation (TV) and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2011
2011
We prove a result relating the author’s monotone functional interpretation to the bounded functional interpretation due to… Expand
2009
2009
This paper addresses the strength of Ramsey's theorem for pairs (RT 2 ) over a weak base theory from the perspective of 'proof… Expand
2007
2007
We consider almost upper-semicontinuous processes defined on a finite Markov chain. The distributions of functionals associated… Expand
2006
2006
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes… Expand
  • table 1
Highly Cited
2004
Highly Cited
2004
The sequence of Gaver functionals is useful in the numerical inversion of Laplace transforms. The convergence behavior of the… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
2000
2000
Abstract. Let T be Gödel's system of primitive recursive functionals of finite type in a combinatory logic formulation. Let $T… Expand
1998
1998
Abstract. The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so… Expand
1991
1991
This paper presents an extension of an ML style type system to support dependent product types for programs. The study is based… Expand
1982
1982
It is known that every <ec-recursive function is also a primitive recursive functional. Kreisel has proved this by means of G6del… Expand