Foundational extensible corecursion: a proof assistant perspective
From MaRDI portal
Publication:2981955
DOI10.1145/2784731.2784732zbMath1360.68358arXiv1501.05425MaRDI QIDQ2981955
Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel
Publication date: 10 May 2017
Published in: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05425
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Compositional Coinduction with Sized Types, Probabilistic Functions and Cryptographic Oracles in Higher Order Logic, Model Finding for Recursive Functions in SMT, A Consistent Foundation for Isabelle/HOL
Uses Software