The power of parameterization in coinductive proof
DOI10.1145/2429069.2429093zbMath1301.68220OpenAlexW2014364142MaRDI QIDQ2931796
Viktor Vafeiadis, Georg Neis, Derek R. Dreyer, Chung-Kil Hur
Publication date: 27 November 2014
Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2429069.2429093
simulationcompositionalitylattice theorycoinductioninteractive theorem provingparameterized greatest fixed point
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Lattices (06B99)
Related Items (29)
Uses Software
This page was built for publication: The power of parameterization in coinductive proof