Hugo Herbelin

Available identifiers

zbMath Open herbelin.hugoMaRDI QIDQ636370

List of research outcomes

Publication	Date of Publication	Type
A calculus of expandable stores	2021-01-21	Paper
Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control	2018-07-17	Paper
A Constructive Proof of Dependent Choice, Compatible with Classical Logic	2017-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q2968416	2017-03-13	Paper
A dependently-typed construction of semi-simplicial types	2016-07-27	Paper
The duality of computation	2015-09-11	Paper
A type-theoretic foundation of continuations and prompts	2015-03-09	Paper
An approach to call-by-name delimited continuations	2014-09-12	Paper
30 years of research and development around Coq	2014-04-10	Paper
Pure type system conversion is always typable	2013-08-19	Paper
Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems	2013-08-09	Paper
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts	2012-07-20	Paper
Kripke models for classical logic	2011-08-26	Paper
Classical Call-by-Need and Duality	2011-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q3075443	2011-02-15	Paper
Interactive models of computation and program behavior	2010-05-27	Paper
A type-theoretic foundation of delimited continuations	2010-05-05	Paper
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form	2009-07-07	Paper
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus	2009-07-02	Paper
A New Elimination Rule for the Calculus of Inductive Constructions	2009-07-02	Paper
Control reduction theories: the benefit of structural substitution	2008-05-22	Paper
A proof-theoretic foundation of abortive continuations	2007-12-17	Paper
Typed Lambda Calculi and Applications	2005-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q3024909	2005-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q4474830	2004-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q4449226	2004-02-08	Paper
Explicit substitutions and reducibility	2002-05-05	Paper
A-translation and looping combinators in pure type systems	1995-06-11	Paper
The two list algorithm for the knapsack problem on an FPS T20	1989-01-01	Paper
"An analysis of the constructive content of Henkin's proof of G\""odel's completeness theorem"	N/A	Paper

Research outcomes over time

This page was built for person: Hugo Herbelin