Étienne Miquey

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey(More)
The dependent sum type of Martin-Löf's type theory provides a strong existential elimination , which allows to prove the full axiom of choice. The proof is simple and constructive: AC A := λH.(λx. wit(Hx), λx. prf(Hx)) : ∀x A ∃y B P (x, y) → ∃f A→B ∀x A P (x, f (x)) where wit and prf are the first and second projections of a strong existential quantifier.(More)
  • 1