Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for Computational Paths. The Calculus of Equality
Stock Image
Computational Paths. The Calculus of Equality
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 53800710-n
Stock Image
Computational Paths. The Calculus of Equality
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9781848905153
Stock Image
Computational Paths. The Calculus of Equality
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 53800710
Stock Image
Computational Paths. The Calculus of Equality
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9781848905153
Stock Image
Computational Paths. The Calculus of Equality
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9781848905153
Buy New
£ 25.86
£ 5.87 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Computational Paths. The Calculus of Equality (Paperback)
Print on DemandSeller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781848905153
Seller Image
Computational Paths. The Calculus of Equality (Paperback or Softback)
Published by
College Publications 5/11/2026, 2026
ISBN 10: 1848905157
ISBN 13: 9781848905153
New
Paperback or Softback
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Seller rating 5 out of 5 stars
Paperback or Softback. Condition: New. Computational Paths. The Calculus of Equality. Book. Seller Inventory # BBS-9781848905153
Stock Image
Computational Paths. The Calculus of Equality
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 53800710-n
Buy New
£ 25.85
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Computational Paths. The Calculus of Equality
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 53800710
Buy Used
£ 27.78
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Computational Paths. The Calculus of Equality (Paperback)
Print on DemandSeller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781848905153
Buy New
£ 29.49
£ 37 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available