Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers
Ana Bove (Chalmers University of Technology), Ekaterina Komendantskaya, (University of Dundee), Milad Niqui (CWI)

TL;DR
This workshop volume presents recent research on handling partial functions and (co)recursion in interactive theorem provers, addressing key challenges in formal verification and proof automation.
Contribution
It compiles new approaches and methods for managing partiality and recursion in theorem proving systems, advancing the field's capabilities.
Findings
New techniques for partial function handling
Innovative methods for recursion termination
Enhanced proof automation strategies
Abstract
This volume contains the proceedings of the Workshop on Partiality and Recursion in Interactive Theorem Provers (PAR 2010) which took place on July 15 in Edinburgh, UK. This workshop was held as a satellite workshop of the International Conference on Interactive Theorem Proving (ITP 2010), itself part of the Federated Logic Conference 2010 (FLoC 2010). This workshop is a venue for researchers working on new approaches to cope with partial functions and terminating general (co)recursion in theorem provers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
