Polymorphic extensions of simple type structures. With an application to a bar recursive minimization

DOI10.1016/0168-0072(95)00025-9zbMath0862.03004OpenAlexW2171495347MaRDI QIDQ1919547

Erik Barendsen, Marc Bezem

Publication date: 28 May 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/28027

zbMATH Keywords

polymorphismpartial equivalence relationsfunctionals\(\lambda\)-calculusmodelfan functionalbar recursionoraclesminimization functionalreduction relationextensions of Gödel's \textbf{T}simple type structure

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Proof theory in general (including proof-theoretic semantics) (03F03) Combinatory logic and lambda calculus (03B40)

Related Items

A family of restricted subadditive recursions

Cites Work

• Extensional models for polymorphism
• The semantics of second-order lambda calculus
• Constructivity in mathematics. Proceedings of the colloquium, held at Amsterdam, 1957
• The lambda calculus, its syntax and semantics
• Totality in applicative theories
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Recursive Functionals and Quantifiers of Finite Types I
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Lambda-definable functionals of finite types
• The Expressiveness of Simple and Second-Order Type Structures
• Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
• Theoretical Pearls
• Intensional interpretations of functionals of finite type I
• Tree-Manipulating Systems and Church-Rosser Theorems
• Function Theory in an Axiom-Free Equation Calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item