Skip to Main content Skip to Navigation
Journal articles

Perspectives for proof unwinding by programming languages techniques

Danko Ilik 1
1 PARSIFAL - Proof search and reasoning with logic specifications
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages into proof theory. This scientific essay, written for the audience of proof theorists as well as the working mathematician, is not a survey of the field, but rather a personal view of the author who hopes that it may inspire future and fellow researchers.
Complete list of metadatas

Cited literature [49 references]  Display  Hide  Download

https://hal.inria.fr/hal-01354180
Contributor : Danko Ilik <>
Submitted on : Wednesday, August 17, 2016 - 5:43:45 PM
Last modification on : Thursday, March 5, 2020 - 6:25:28 PM
Long-term archiving on: : Friday, November 18, 2016 - 11:48:28 AM

Files

KGS-book-chapter-danko.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

  • HAL Id : hal-01354180, version 1
  • ARXIV : 1605.09177

Collections

Citation

Danko Ilik. Perspectives for proof unwinding by programming languages techniques. IfColog Journal of Logics and their Applications (FLAP), College Publications, 2017, 4 (10), pp.3487-3508. ⟨hal-01354180⟩

Share

Metrics

Record views

309

Files downloads

211