Proof Methods for Structured Corecursive Programs
Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, which consume values of least fixpoint types. There are a number of widely used methods for proving properties of corecursive programs, including fixpoint induction, the <em>take lemma</em>...
मुख्य लेखकों: | Gibbons, J, Hutton, G |
---|---|
स्वरूप: | Conference item |
प्रकाशित: |
1999
|
समान संसाधन
-
Proof methods for corecursive programs
द्वारा: Gibbons, J, और अन्य
प्रकाशित: (2005) -
Proof Methods for Corecursive Programs
द्वारा: Gibbons, J, और अन्य
प्रकाशित: (2015) -
Proof of a Structured Program: ‘The Sieve of Eratosthenes'
द्वारा: Hoare, C
प्रकाशित: (1972) -
Program Correctness Proofs
द्वारा: Hoare, C
प्रकाशित: (1975) -
Generic Programs and Proofs
द्वारा: Hinze, R
प्रकाशित: (2000)