Name
Abstract | ||
|---|---|---|
We show how to solve the word problem for simply typed λβη-calculus by using a few well-known facts about categories of presheaves and the Yoneda embedding. The formal setting for these results is 𝒫-category theory, a version of ordinary category theory where each hom-set is equipped with a partial equivalence relation. The part of 𝒫-category theory we develop here is constructive and thus permits extraction of programs from proofs. It is important to stress that in our method we make no use of traditional proof-theoretic or rewriting techniques. To show the robustness of our method, we give an extended treatment for more general λ-theories in the Appendix. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1017/S0960129597002508 | Mathematical Structures in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Embedding,Element (category theory),Partial equivalence relation,Constructive,Word problem (mathematics education),Mathematical proof,Rewriting,Category theory,Mathematics | Journal | 8 |
Issue | Citations | PageRank |
2 | 22 | 1.74 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Djordje Cubric | 1 | 23 | 2.51 |
| Peter Dybjer | 2 | 540 | 76.99 |
| Philip J. Scott | 3 | 127 | 18.30 |