The following pages link to Hugo Herbelin (Q636370):
Displayed 30 items.
- Kripke models for classical logic (Q636371) (← links)
- A type-theoretic foundation of delimited continuations (Q968364) (← links)
- (Q1118988) (redirect page) (← links)
- The two list algorithm for the knapsack problem on an FPS T20 (Q1118989) (← links)
- Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control (Q1652990) (← links)
- A proof-theoretic foundation of abortive continuations (Q2464725) (← links)
- Explicit Substitutions and Reducibility (Q2752530) (← links)
- Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems (Q2843039) (← links)
- Pure Type System conversion is always typable (Q2844696) (← links)
- Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts (Q2900256) (← links)
- The duality of computation (Q2943375) (← links)
- (Q2968416) (← links)
- A Constructive Proof of Dependent Choice, Compatible with Classical Logic (Q2986812) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- (Q3024909) (← links)
- (Q3075443) (← links)
- An approach to call-by-name delimited continuations (Q3189857) (← links)
- Control reduction theories: the benefit of structural substitution (Q3503192) (← links)
- (Q3564946) (← links)
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (Q3637192) (← links)
- A New Elimination Rule for the Calculus of Inductive Constructions (Q3638245) (← links)
- Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus (Q3638285) (← links)
- (Q4449226) (← links)
- (Q4474830) (← links)
- A-translation and looping combinators in pure type systems (Q4764266) (← links)
- A calculus of expandable stores (Q5145663) (← links)
- A type-theoretic foundation of continuations and prompts (Q5178020) (← links)
- 30 years of research and development around Coq (Q5408420) (← links)
- Typed Lambda Calculi and Applications (Q5704010) (← links)
- A dependently-typed construction of semi-simplicial types (Q5740652) (← links)