Skip to search formSkip to main contentSkip to account menu

Primitive recursive functional

In mathematical logic, the primitive recursive functionals are a generalization of primitive recursive functions into higher type theory. They… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Computability theory
CurryingPrimitive recursive functionType theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Gandy-Hyland functional and a hitherto unknown computational aspect of Nonstandard Analysis
In this paper, we highlight a new computational aspect of Nonstandard Analysis relating to higher-order computability theory. In… 
2011
2011
A note on the monotone functional interpretation
We prove a result relating the author's monotone functional interpretation to the bounded functional interpretation due to… 
2009
2009
Ramsey's Theorem for Pairs and Provably Recursive Functions
  • Notre Dame J. Formal Log.
  • 2009
  • Corpus ID: 5702437
This paper addresses the strength of Ramsey's theorem for pairs (RT 2 ) over a weak base theory from the perspective of 'proof… 
Review
2008
Review
2008
Derivation and Computation : taking the Curry-Howard correspondence seriously
4. Derivation and Computation: taking the Curry-Howard correspondence seriously by Harold Simmons. Review by Robert J. Irwin. My… 
Highly Cited
2004
Highly Cited
2004
Comparison of sequence accelerators forthe Gaver method of numerical Laplace transform inversion
2000
2000
Characterizing the elementary recursive functions by a fragment of Gödel's T
Abstract. Let T be Gödel's system of primitive recursive functionals of finite type in a combinatory logic formulation. Let $T… 
1998
1998
A restricted computation model on Scott domains and its partial primitive recursive functionals
Abstract. The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so… 
Highly Cited
1993
Highly Cited
1993
Synthesis of ML Programs in the System Coq
1991
1991
Primitive Recursive Functionals with Dependent Types
This paper presents an extension of an ML style type system to support dependent product types for programs. The study is based… 
1982
1982
On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising
It is known that every < ε0-recursive function is also a primitive recursive functional. Kreisel has proved this by means of G… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)