Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

adding bibliography entries in Confluence chapter #907

Merged
merged 3 commits into from
Sep 11, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
39 changes: 39 additions & 0 deletions data/bibliography.bib
Original file line number Diff line number Diff line change
Expand Up @@ -107,3 +107,42 @@ @book{Rocca:2004
publisher = {Springer},
title = {The Parametric Lambda Calculus},
year = {2004}}

@inproceedings{Schafer:2015,
title={Autosubst: Reasoning with de Bruijn terms and parallel substitutions},
author={Sch{\"a}fer, Steven and Tebbi, Tobias and Smolka, Gert},
booktitle={Interactive Theorem Proving: 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings 6},
pages={359--374},
year={2015},
organization={Springer}
}

@techreport{Pfenning:1992,
author = {Pfenning, Frank},
institution = {Carnegie Mellon University},
number = {CMU-CS-92-186},
publisher = {Carnegie Mellon University},
title = {A Proof of the Church-Rosser Theorem and Its Representation in a Logical Framework},
year = {1992}}

@article{Takahashi:1995,
title = {Parallel Reductions in λ-Calculus},
journal = {Information and Computation},
volume = {118},
number = {1},
pages = {120-127},
year = {1995},
doi = {https://doi.org/10.1006/inco.1995.1057},
author = {M. Takahashi}}

@inproceedings{Nipkow:1996,
author = {Nipkow, Tobias},
title = {More Church-Rosser Proofs (in Isabelle/HOL)},
year = {1996},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
booktitle = {Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction},
pages = {733–747},
numpages = {15},
series = {CADE-13}
}
8 changes: 4 additions & 4 deletions src/plfa/part2/Confluence.lagda.md
Original file line number Diff line number Diff line change
Expand Up @@ -608,13 +608,13 @@ confluence L↠M₁ L↠M₂
## Notes

This mechanized proof of confluence is based on several sources. The
`subst-par` lemma is the "strong substitutivity" lemma of Shafer,
Tebbi, and Smolka (ITP 2015). The proofs of `par-triangle`, `strip`,
`subst-par` lemma is the "strong substitutivity" lemma of
@Schafer:2015. The proofs of `par-triangle`, `strip`,
and `par-confluence` are based on the notion of complete development
by Takahashi (1995) and Pfenning's 1992 technical report about the
by @Takahashi:1995 and the technical report by @Pfenning:1992 about the
Church-Rosser theorem. In addition, we consulted Nipkow and
Berghofer's mechanization in Isabelle, which is based on an earlier
article by Nipkow (JAR 1996).
paper by @Nipkow:1996.

## Unicode

Expand Down
Loading