1,907 research outputs found
On choice rules in dependent type theory
In a dependent type theory satisfying the propositions as
types correspondence together with the proofs-as-programs paradigm,
the validity of the unique choice rule or even more of the choice rule says
that the extraction of a computable witness from an existential statement
under hypothesis can be performed within the same theory.
Here we show that the unique choice rule, and hence the choice rule,
are not valid both in Coquand\u2019s Calculus of Constructions with indexed
sum types, list types and binary disjoint sums and in its predicative
version implemented in the intensional level of the Minimalist Founda-
tion. This means that in these theories the extraction of computational
witnesses from existential statements must be performed in a more ex-
pressive proofs-as-programs theory
Bibliography on Realizability
AbstractThis document is a bibliography on realizability and related matters. It has been collected by Lars Birkedal based on submissions from the participants in âA Workshop on Realizability Semantics and Its Applicationsâ, Trento, Italy, June 30âJuly 1, 1999. It is available in BibTEX format at the following URL: http://www.cs.cmu.edu./~birkedal/realizability-bib.html
Sets in homotopy type theory
Homotopy Type Theory may be seen as an internal language for the
-category of weak -groupoids which in particular models the
univalence axiom. Voevodsky proposes this language for weak -groupoids
as a new foundation for mathematics called the Univalent Foundations of
Mathematics. It includes the sets as weak -groupoids with contractible
connected components, and thereby it includes (much of) the traditional set
theoretical foundations as a special case. We thus wonder whether those
`discrete' groupoids do in fact form a (predicative) topos. More generally,
homotopy type theory is conjectured to be the internal language of `elementary'
-toposes. We prove that sets in homotopy type theory form a -pretopos. This is similar to the fact that the -truncation of an
-topos is a topos. We show that both a subobject classifier and a
-object classifier are available for the type theoretical universe of sets.
However, both of these are large and moreover, the -object classifier for
sets is a function between -types (i.e. groupoids) rather than between sets.
Assuming an impredicative propositional resizing rule we may render the
subobject classifier small and then we actually obtain a topos of sets
Existential witness extraction in classical realizability and via a negative translation
We show how to extract existential witnesses from classical proofs using
Krivine's classical realizability---where classical proofs are interpreted as
lambda-terms with the call/cc control operator. We first recall the basic
framework of classical realizability (in classical second-order arithmetic) and
show how to extend it with primitive numerals for faster computations. Then we
show how to perform witness extraction in this framework, by discussing several
techniques depending on the shape of the existential formula. In particular, we
show that in the Sigma01-case, Krivine's witness extraction method reduces to
Friedman's through a well-suited negative translation to intuitionistic
second-order arithmetic. Finally we discuss the advantages of using call/cc
rather than a negative translation, especially from the point of view of an
implementation.Comment: 52 pages. Accepted in Logical Methods for Computer Science (LMCS),
201
Perspectives for proof unwinding by programming languages techniques
In this chapter, we propose some future directions of work, potentially
beneficial to Mathematics and its foundations, based on the recent import of
methodology from the theory of programming languages into proof theory. This
scientific essay, written for the audience of proof theorists as well as the
working mathematician, is not a survey of the field, but rather a personal view
of the author who hopes that it may inspire future and fellow researchers
An Introduction to Mechanized Reasoning
Mechanized reasoning uses computers to verify proofs and to help discover new
theorems. Computer scientists have applied mechanized reasoning to economic
problems but -- to date -- this work has not yet been properly presented in
economics journals. We introduce mechanized reasoning to economists in three
ways. First, we introduce mechanized reasoning in general, describing both the
techniques and their successful applications. Second, we explain how mechanized
reasoning has been applied to economic problems, concentrating on the two
domains that have attracted the most attention: social choice theory and
auction theory. Finally, we present a detailed example of mechanized reasoning
in practice by means of a proof of Vickrey's familiar theorem on second-price
auctions
A predicative variant of a realizability tripos for the Minimalist Foundation.
open2noHere we present a predicative variant of a realizability tripos validating
the intensional level of the Minimalist Foundation extended with Formal Church
thesis.the file attached contains the whole number of the journal including the mentioned pubblicationopenMaietti, Maria Emilia; Maschio, SamueleMaietti, MARIA EMILIA; Maschio, Samuel
Trocq: Proof Transfer for Free, With or Without Univalence
Libraries of formalized mathematics use a possibly broad range of different
representations for a same mathematical concept. Yet light to major manual
input from users remains most often required for obtaining the corresponding
variants of theorems, when such obvious replacements are typically left
implicit on paper. This article presents Trocq, a new proof transfer framework
for dependent type theory. Trocq is based on a novel formulation of type
equivalence, used to generalize the univalent parametricity translation. This
framework takes care of avoiding dependency on the axiom of univalence when
possible, and may be used with more relations than just equivalences. We have
implemented a corresponding plugin for the Coq proof assistant, in the CoqElpi
meta-language. We use this plugin on a gallery of representative examples of
proof transfer issues in interactive theorem proving, and illustrate how Trocq
covers the spectrum of several existing tools, used in program verification as
well as in formalized mathematics in the broad sense
A Normalizing Intuitionistic Set Theory with Inaccessible Sets
We propose a set theory strong enough to interpret powerful type theories
underlying proof assistants such as LEGO and also possibly Coq, which at the
same time enables program extraction from its constructive proofs. For this
purpose, we axiomatize an impredicative constructive version of
Zermelo-Fraenkel set theory IZF with Replacement and -many
inaccessibles, which we call \izfio. Our axiomatization utilizes set terms, an
inductive definition of inaccessible sets and the mutually recursive nature of
equality and membership relations. It allows us to define a weakly-normalizing
typed lambda calculus corresponding to proofs in \izfio according to the
Curry-Howard isomorphism principle. We use realizability to prove the
normalization theorem, which provides a basis for program extraction
capability.Comment: To be published in Logical Methods in Computer Scienc
- âŠ