and
definability which are machines or theories dependent.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting to learn something about it, It is based on type theory,
category theory and topology.
That is very interesting, and category provides nice model
are paths from premises to conclussion in a space with
topological properties
And the theory stablish topological relations between these paths so
that proofs and computer algorithms are classified according with
these relations.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting
on the
algebra of proofs.
But proofs and computations are not equivalent concept at all. There
is a Church's thesis for computability, not for provability and
definability which are machines or theories dependent.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting
on the
algebra of proofs.
But proofs and computations are not equivalent concept at all. There
is a Church's thesis for computability, not for provability and
definability which are machines or theories dependent.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting
stablish topological relations between these paths so
that proofs and computer algorithms are classified according with
these relations.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting to learn something about it, It is based on type
theory,
category theory
.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting to learn something about it, It is based on type
theory,
category theory and topology.
That is very interesting, and category provides nice model for
constructive subpart of the computable, like typed lambda calculus
.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting to learn something about it, It is based on type
theory,
category theory and topology. The book introduction is nice (HOTT
link
at the bottom of the page). It seems to be a foundation of
computer
science and math that unify both
On 1/12/2014 1:57 AM, Bruno Marchal wrote:
You might study the book by Szabo, on the category approach on the algebra of
proofs.
But proofs and computations are not equivalent concept at all. There is a Church's
thesis for computability, not for provability and definability which are machines
properties
And the theory stablish topological relations between these paths so
that proofs and computer algorithms are classified according with
these relations.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting to learn something about it, It is based on type theory
relations between these paths so
that proofs and computer algorithms are classified according with
these relations.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting to learn something about it, It is based on type theory,
category theory and topology. The book introduction
algorithms are classified according with
these relations.
That is homotopy type theory.
http://homotopytypetheory.org/
I´m starting to learn something about it, It is based on type theory,
category theory and topology. The book introduction is nice (HOTT link
at the bottom of the page
11 matches
Mail list logo
