Proof Methods for Structured Corecursive Programs

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>...

Bibliografske podrobnosti
Main Authors:	Gibbons, J, Hutton, G
Format:	Conference item
Izdano:	1999

Podobne knjige/članki

Proof methods for corecursive programs
od: Gibbons, J, et al.
Izdano: (2005)

Proof Methods for Corecursive Programs
od: Gibbons, J, et al.
Izdano: (2015)

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

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

Program Correctness Proofs
od: Hoare, C
Izdano: (1975)

Generic Programs and Proofs
od: Hinze, R
Izdano: (2000)

Induction in Proofs about Programs
od: Greif, Irene Gloria
Izdano: (2023)

Proof of a Program: FIND
od: Hoare, C
Izdano: (1971)

Structured programming in Java
od: Gibbons, J
Izdano: (1998)

Structured Programming in Java
od: Gibbons, J
Izdano: (1998)

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

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

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

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

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

The generic approximation lemma
od: Hutton, G, et al.
Izdano: (2001)

The Generic Approximation Lemma
od: Hutton, G, et al.
Izdano: (2001)

Transition to higher mathematics : structure and proof /
od: 222490 Dumas, Bob A., et al.
Izdano: (2007)

Discrete mathematics : proofs, structures, and applications /
od: 534515 Garnier, Rowan, et al.
Izdano: (c201)

Fire Proof Design in the Steel Structure
od: HONG Fei-fei
Izdano: (2006-01-01)

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

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

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

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

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

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

Proofs with Graphs
od: Curtis, S, et al.
Izdano: (1996)

Proof constructions and evaluations
od: Stylianides, G, et al.
Izdano: (2009)

Mechanised Hypersafety Proofs about Structured Data
od: Gladshtein, Vladimir, et al.
Izdano: (2024)

Steel structures: numerical analysis of fire proofing
od: Artem A. Bunov, et al.
Izdano: (2022-09-01)

Dealing with proofs
od: Ng, K.H., et al.
Izdano: (2009)

Proof /
od: Plumpton, C. (Charles), et al.
Izdano: (1984)

Proof /
od: Architectural League of New York
Izdano: (2008)

Living proof /
od: 459964 Thompson, Peter J.
Izdano: (2003)

Bullet proof
od: Binner, J, et al.
Izdano: (2013)

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

Programming in haskell /
od: 266356 Hutton, Graham
Izdano: (2007)

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

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

Proof constructions and evaluations
od: Stylianides, A, et al.
Izdano: (2009)