Search Results - "Herbelin, H."
-
1
Explicit Substitutions and Reducibility
Published in Journal of logic and computation (01-06-2001)“…We consider reducibility sets defined not by induction on types but by induction on sequents as a tool to prove strong normalization of systems with explicit…”
Get full text
Journal Article -
2
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (01-06-2012)“…Martin-Löf's type theory has strong existential elimination (dependent sum type) that allows to prove the full axiom of choice. However the theory is…”
Get full text
Conference Proceeding
-
3
An Intuitionistic Logic that Proves Markov's Principle
Published in 2010 25th Annual IEEE Symposium on Logic in Computer Science (01-07-2010)“…We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov's principle suited…”
Get full text
Conference Proceeding -
4
Game semantics and abstract machines
Published in Proceedings 11th Annual IEEE Symposium on Logic in Computer Science (1996)“…The interaction processes at work by M. Hyland and L. Ong (1994) (HO) and S. Abramsky et al. (1994) (AJM) new game semantics are two preexisting paradigmatic…”
Get full text
Conference Proceeding