The following pages link to Valentin Blot (Q345703):
Displaying 14 items.
- Realizability for Peano arithmetic with winning conditions in HON games (Q345704) (← links)
- On Bar Recursion and Choice in a Classical Setting (Q2937797) (← links)
- Typed realizability for first-order classical analysis (Q3460427) (← links)
- Quasi-Affine Transformation in Higher Dimension (Q3648810) (← links)
- Quasi-Affine Transformation in 3-D: Theory and Algorithms (Q3651604) (← links)
- Hybrid realizability for intuitionistic and classical choice (Q4635918) (← links)
- (Q5144612) (← links)
- Extensional and Intensional Semantic Universes (Q5145281) (← links)
- Realizability for Peano Arithmetic with Winning Conditions in HON Games (Q5300895) (← links)
- Classical Extraction in Continuation Models (Q5369478) (← links)
- Diller-Nahm bar recursion (Q6622077) (← links)
- From rewrite rules to axioms in the \(\lambda \varPi \)-calculus modulo theory (Q6629514) (← links)
- A semantics of \(\mathbb{K}\) into Dedukti (Q6643042) (← links)
- A direct computational interpretation of second-order arithmetic via update recursion (Q6649499) (← links)
