Reference. CoLF Logic Programming as Infinitary Proof Exploration

Cite

Cite as @chen-2025-colf (helia, typst) · \cite{chen-2025-colf} (LaTeX)
BibTeX
bibtex · 1 line
@article{chen-2025-colf, title={CoLF Logic Programming as Infinitary Proof Exploration}, volume={431}, ISSN={2075-2180}, url={http://dx.doi.org/10.4204/eptcs.431.3}, DOI={10.4204/eptcs.431.3}, journal={Electronic Proceedings in Theoretical Computer Science}, publisher={Open Publishing Association}, author={Chen, Zhibo and Pfenning, Frank}, year={2025}, month=Oct, pages={34–41} }
hayagriva YAML (typst)
yaml · 17 lines
chen-2025-colf:
  type: article
  title: CoLF Logic Programming as Infinitary Proof Exploration
  author:
  - Chen, Zhibo
  - Pfenning, Frank
  date: 2025-10
  page-range: 34-41
  url: http://dx.doi.org/10.4204/eptcs.431.3
  serial-number:
    doi: 10.4204/eptcs.431.3
    issn: 2075-2180
  parent:
    type: periodical
    title: Electronic Proceedings in Theoretical Computer Science
    publisher: Open Publishing Association
    volume: 431
chen-2025-colf reference entries/refs/chen-2025-colf/chen-2025-colf.hel