Proof Methods for Corecursive Programs (1999)

by Jeremy Gibbons , Graham Hutton
Venue:Fundamenta Informaticae Special Issue on Program Transformation
Citations:21 - 6 self

Documents Related by Co-Citation

215 Introduction to Functional Programming using Haskell – R Bird - 1998
1312 Monads for functional programming – Philip Wadler - 1995
49 The Under-Appreciated Unfold – Jeremy Gibbons, Geraint Jones - 1998
299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
193 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
43 Stream Fusion. From Lists to Streams to Nothing at All – Duncan Coutts, Roman Leshchinskiy, Don Stewart - 2007
58 A tutorial on the universality and expressiveness of fold – Graham Hutton - 1999
65 A functional correspondence between evaluators and abstract machines – Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard - 2003
83 Infinite Objects in Type Theory – Thierry Coquand
724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
10 Functional pearl: Streams and unique fixed points – Ralf Hinze - 2008
24 Fast and Loose Reasoning is Morally Correct – Nils Anders Danielsson, Nils Anders, Danielsson John Hughes, Patrik Jansson - 2006
39 Type-Based Termination of Recursive Definitions РG. Barthe, M. J. Frade, E. Gim̩nez, L. Pinto, T. Uustalu - 2002
64 Cheap Deforestation for Non-strict Functional Languages – Andrew John Gill, Andrew John Gill - 1996
6 Introducing the Haskell Equational Reasoning Assistant – Andy Gill - 2006
13 The Generic Approximation Lemma – Graham Hutton, Jeremy Gibbons - 2001
365 Types, abstraction and parametric polymorphism – J C Reynolds - 1983
121 Bisimilarity as a theory of functional programming – A D Gordon