When are two proofs of the same proposition equal? This book answers through computational paths - explicit syntactic witnesses that record how one proof-term rewrites into another. Continuing the programme begun in The Functional Interpretation of Logical Deduction (2011), it extends the Curry-Howard correspondence and the tradition of labelled deductive systems into a rewrite calculus of proof equalities. Part I develops a 77-rule rewrite system on paths, proves it confluent and terminating, and derives decidable path equivalence from unique normal forms. Part II uncovers the higher-dimensional structure latent in this calculus: paths assemble into a weak ¿-groupoid, with 2-cells as derivations between paths, 3-cells as coherences between derivations, and the Eckmann-Hilton argument recovered directly from rewrite combinatorics. Part III turns outward - to path induction and the J-eliminator, the failure of UIP and the resulting proof-relevance, fundamental groupoids of combinatorial spaces, and the framework's relationship to Homotopy Type Theory, category theory, and higher algebra. The approach shares conceptual ground with HoTT but diverges in its commitments: where HoTT posits univalence and higher inductive types, computational paths offer explicit rewrite witnesses and effective normalisation, with path equivalence rendered decidable rather than postulated. A companion Lean 4 formalization machine-checks the core constructions and major theorems. Aimed at logicians, type theorists, and mathematicians concerned with the computational content of equality, the volume is self-contained - appendices cover term rewriting and higher groupoids - while charting a research programme that reaches toward dependent types, directed rewriting, and homotopical semantics.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 53800710-n
Quantité disponible : Plus de 20 disponibles
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
Paperback or Softback. Etat : New. Computational Paths. The Calculus of Equality. Book. N° de réf. du vendeur BBS-9781848905153
Quantité disponible : 5 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 53800710
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9781848905153
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9781848905153
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9781848905153
Quantité disponible : Plus de 20 disponibles
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Paperback. Etat : New. N° de réf. du vendeur LU-9781848905153
Quantité disponible : Plus de 20 disponibles
Vendeur : Rarewaves USA, HEBRON, KY, Etats-Unis
Paperback. Etat : New. N° de réf. du vendeur LU-9781848905153
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 53800710-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 53800710
Quantité disponible : Plus de 20 disponibles