The following pages link to Vincent Rahli (Q507362):
Displaying 19 items.
- Skalpel: a constraint-based type error slicer for standard ML (Q507365) (← links)
- Skalpel: a type error slicer for standard ML (Q530861) (← links)
- Exercising Nuprl’s Open-Endedness (Q2819194) (← links)
- Towards a Formally Verified Proof Assistant (Q2879241) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- Reducibility Proofs in the λ-Calculus (Q4903716) (← links)
- On Realisability Semantics for Intersection Types with Expansion Variables (Q4903717) (← links)
- (Q5144620) (← links)
- Computability Beyond Church-Turing via Choice Sequences (Q5145297) (← links)
- Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction (Q5178963) (← links)
- A Verified Theorem Prover Backend Supported by a Monotonic Library (Q5222980) (← links)
- Bar Induction is Compatible with Constructive Type Theory (Q5244386) (← links)
- Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types (Q5327349) (← links)
- Uniform Circuits, & Boolean Proof Nets (Q5434522) (← links)
- A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables (Q5505601) (← links)
- Constructing unprejudiced extensional type theories with choices via modalities (Q6544102) (← links)
- \(\text{TT}^\Box_{\mathcal{C}}\): a family of extensional type theories with effectful realizers of continuity (Q6597949) (← links)
- Realizing continuity using stateful computations (Q6610616) (← links)
- Inductive continuity via Brouwer trees (Q6647666) (← links)
