The power of parameterization in coinductive proof
Open Access
- 23 January 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 48 (1) , 193-206
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Recursion on Nested Datatypes in Dependent Type Theory2008
- Iterative Circular Coinduction for CoCasl in Isabelle/HOLLecture Notes in Computer Science, 2005
- Type-based termination of recursive definitionsMathematical Structures in Computer Science, 2004
- Parametric corecursionTheoretical Computer Science, 2001
- Bisimilarity as a theory of functional programmingTheoretical Computer Science, 1999
- On the bisimulation proof methodMathematical Structures in Computer Science, 1998
- Local model checking in the modal mu-calculus1989
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- An axiomatic proof technique for parallel programs IActa Informatica, 1976
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955