# 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)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We prove a result relating the author's monotone functional interpretation to the bounded functional interpretation due to…
2009
2009
• 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
4. Derivation and Computation: taking the Curry-Howard correspondence seriously by Harold Simmons. Review by Robert J. Irwin. My…
2006
2006
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes…
2002
2002
2000
2000
• Arch. Math. Log.
• 2000
• Corpus ID: 33349010
Abstract. Let T be Gödel's system of primitive recursive functionals of finite type in a combinatory logic formulation. Let $T… 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…
Highly Cited
1993
Highly Cited
1993
• J. Symb. Comput.
• 1993
• Corpus ID: 29439191
1991
1991
This paper presents an extension of an ML style type system to support dependent product types for programs. The study is based…