Proof Methods for Corecursive Programs

Proof Methods for Corecursive Programs

Show other versions (1)

Recursion is a well-known and powerful programming technique, with a wide variety of applications. The dual technique of corecursion is less well-known, but is increasingly proving to be just as useful. This article is a tutorial on four methods for proving properties of corecursive programs: fixpoi...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Gibbons, J, Hutton, G
Format:	Journal article
Udgivet:	2015

Lignende værker

Proof methods for corecursive programs
af: Gibbons, J, et al.
Udgivet: (2005)

Proof Methods for Structured Corecursive Programs
af: Gibbons, J, et al.
Udgivet: (1999)

Corecursive Algebras, Corecursive Monads and Bloom Monads
af: Jiří Adámek, et al.
Udgivet: (2014-09-01)

Program Correctness Proofs
af: Hoare, C
Udgivet: (1975)

Generic Programs and Proofs
af: Hinze, R
Udgivet: (2000)

Induction in Proofs about Programs
af: Greif, Irene Gloria
Udgivet: (2023)

Proof of a Program: FIND
af: Hoare, C
Udgivet: (1971)

An Integrated Proof Language for Imperative Programs
af: Zee, Karen, et al.
Udgivet: (2010)

Proof of a Recursive Program: Quicksort
af: Foley, M, et al.
Udgivet: (1971)

Model and proof generation for heap-manipulating programs
af: Brain, M, et al.
Udgivet: (2014)

Proof of a Structured Program: ‘The Sieve of Eratosthenes'
af: Hoare, C
Udgivet: (1972)

Model and Proof Generation for Heap−Manipulating Programs
af: Brain, M, et al.
Udgivet: (2014)

Adapting proofs-as-programs : the curry - howard protocol /
af: 287020 Poernomo, Iman Hafiz, et al.
Udgivet: (2005)

The generic approximation lemma
af: Hutton, G, et al.
Udgivet: (2001)

The Generic Approximation Lemma
af: Hutton, G, et al.
Udgivet: (2001)

Proofs that really count : the art of combinatorial proof /
af: 238044 Benjamin, Arthur T., et al.
Udgivet: (2003)

Proof methods for modal and intuitionistic logics /
af: Fitting, Melvin, 1942-
Udgivet: (1983)

Lecture Notes on Algebraic and Coalgebraic Methods for Calculating Functional Programs
af: Gibbons, J
Udgivet: (1999)

Infinite Analysis, Lucky Proof, and Guaranteed Proof in Leibniz
af: Rodriguez-Pereyra, G, et al.
Udgivet: (2011)

When is a Function a Fold or an Unfold?
af: Gibbons, J, et al.
Udgivet: (2001)

When is a function a fold or an unfold?
af: Gibbons, J, et al.
Udgivet: (2001)

Proofs with Graphs
af: Curtis, S, et al.
Udgivet: (1996)

Proof constructions and evaluations
af: Stylianides, G, et al.
Udgivet: (2009)

Dealing with proofs
af: Ng, K.H., et al.
Udgivet: (2009)

Proof /
af: Plumpton, C. (Charles), et al.
Udgivet: (1984)

Proof /
af: Architectural League of New York
Udgivet: (2008)

Living proof /
af: 459964 Thompson, Peter J.
Udgivet: (2003)

Bullet proof
af: Binner, J, et al.
Udgivet: (2013)

Extracting proofs from tabled proof search
af: Miller, Dale., et al.
Udgivet: (2013)

Programming in haskell /
af: 266356 Hutton, Graham
Udgivet: (2007)

GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
af: Chen, Yilei, et al.
Udgivet: (2021)

EVALUATION OF THE CRISIS-PROOF PROGRAMS’ DEVELOPMENT IN RUSSIAN FEDERATION SINCE 2009
af: A. A. Prokhorova
Udgivet: (2016-10-01)

Proof constructions and evaluations
af: Stylianides, A, et al.
Udgivet: (2009)

Proof constructions and evaluations
af: Stylianides, A, et al.
Udgivet: (2009)

Elementary set theory : proof techniques proof techniques /
af: 365632 Gordon, Carl E., et al.
Udgivet: (1975)

Rational proofs
af: Azar, Pablo Daniel, et al.
Udgivet: (2012)

Commenting Proofs
af: Geiser, James R.
Udgivet: (2004)

Burden of proof
af: du Sautoy, M
Udgivet: (2006)

Addicted to Proof
af: Shor, Peter Williston
Udgivet: (2021)

Addicted to Proof
af: Shor, Peter
Udgivet: (2021)