scientific article; zbMATH DE number 7269245
From MaRDI portal
Publication:5129941
No author found.
Publication date: 3 November 2020
Full work available at URL: https://arxiv.org/abs/1906.10719
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- LCF considered as a programming language
- Automated higher-order complexity analysis
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions
- On Spector's bar recursion
- System T and the Product of Selection Functions
- Denotational cost semantics for functional languages with inductive types
- Continuous semantics for strong normalisation
- Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
- Strong normalization of barrecursive terms without using infinite terms
- On bar recursion of types 0 and 1
- Ein starker Normalisationssatz für die bar-rekursiven Funktionale
- On the computational content of the axiom of choice
- A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM
- Validating Brouwer's continuity principle for numbers using named exceptions
- A functional interpretation with state
- A Computational Interpretation of Forcing in Type Theory
- Strong normalisation for applied lambda calculi
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Logical Approaches to Computational Barriers
This page was built for publication:
