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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 53800710-n
Anzahl: Mehr als 20 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Bestandsnummer des Verkäufers I-9781848905153
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 53800710
Anzahl: Mehr als 20 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9781848905153
Anzahl: Mehr als 20 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: new. Paperback. 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 w-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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9781848905153
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9781848905153
Anzahl: Mehr als 20 verfügbar
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Paperback or Softback. Zustand: New. Computational Paths. The Calculus of Equality. Book. Bestandsnummer des Verkäufers BBS-9781848905153
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Bestandsnummer des Verkäufers 53800710-n
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 53800710
Anzahl: Mehr als 20 verfügbar
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Paperback. Zustand: new. Paperback. 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 w-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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Bestandsnummer des Verkäufers 9781848905153
Anzahl: 1 verfügbar