Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Corecursion
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== References == {{Reflist|2}} {{refbegin}} * {{Cite journal | last = Bird | first = Richard Simpson | author-link = Richard Bird (computer scientist)| title = Using circular programs to eliminate multiple traversals of data | doi = 10.1007/BF00264249 | journal = [[Acta Informatica]] | volume = 21 | issue = 3 | pages = 239β250 | year = 1984 | s2cid = 27392591 }} * {{cite journal | doi = 10.1002/spe.4380190202 | first = Lloyd |last=Allison | date = April 1989 | title = Circular Programs and Self-Referential Structures | url = http://www.csse.monash.edu.au/~lloyd/tildeFP/1989SPE/ | journal = Software: Practice and Experience | volume = 19 | issue = 2 | pages = 99β109 | s2cid = 21298473 | arxiv = 2403.01866 }} * {{cite tech report | author = Geraint Jones and [[Jeremy Gibbons]] | title = Linear-time breadth-first tree algorithms: An exercise in the arithmetic of folds and zips | institution = Dept of Computer Science, University of Auckland | year = 1992 | url = http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.5446 }} * {{cite book |author1=Jon Barwise |author2=Lawrence S. Moss |title=Vicious Circles |url=http://www.press.uchicago.edu/presssite/metadata.epl?mode=synopsis&bookkey=3630257 |publisher=Center for the Study of Language and Information |date=June 1996 |isbn=978-1-57586-009-1 |author1-link=Jon Barwise |access-date=2011-01-24 |archive-url=https://web.archive.org/web/20100621142601/http://www.press.uchicago.edu/presssite/metadata.epl?mode=synopsis&bookkey=3630257 |archive-date=2010-06-21 |url-status=dead }} * {{cite journal | doi = 10.1093/jigpal/5.2.231 |author1=Lawrence S. Moss |author2=Norman Danner | title = On the Foundations of Corecursion | journal = Logic Journal of the IGPL | volume = 5 | issue = 2 | pages = 231β257 | year = 1997 |citeseerx=10.1.1.40.4243 }} * {{cite book |author1=Kees Doets |author2=Jan van Eijck | title = The Haskell Road to Logic, Maths, and Programming | url = http://homepages.cwi.nl/~jve/HR/ | publisher = King's College Publications | date = May 2004 | isbn = 978-0-9543006-9-2 }} * {{cite journal | author = David Turner | date = 2004-07-28 | title = Total Functional Programming | url = http://www.jucs.org/jucs_10_7/total_functional_programming | journal = [[Journal of Universal Computer Science]] | volume = 10 | issue = 7 | pages = 751β768 | doi = 10.3217/jucs-010-07-0751 | author-link = David Turner (computer scientist) }} * {{cite journal |author1=Jeremy Gibbons |author2=Graham Hutton | title = Proof methods for corecursive programs | journal = [[Fundamenta Informaticae]] | volume = 66 | issue = 4 | pages = 353β366 | date = April 2005 | url = http://www.cs.nott.ac.uk/~gmh/bib.html#corecursion }} * {{citation | author = Leon P. Smith | date = 2009-07-29 | title = Lloyd Allison's Corecursive Queues: Why Continuations Matter | url = http://themonadreader.wordpress.com/2009/07/29/issue-14/ | journal = The Monad Reader | issue = 14 | pages = 37β68 }} * {{cite web | author = Raymond Hettinger | title = Recipe 576961: Technique for cyclical iteration | url = http://code.activestate.com/recipes/576961/ | date = 2009-11-19 }} * {{cite journal | author = M. B. Smyth and [[Gordon Plotkin|G. D. Plotkin]] | year = 1982 | title = The Category-Theoretic Solution of Recursive Domain Equations | journal = [[SIAM Journal on Computing]] | volume = 11 | issue = 4 | pages = 761β783 | doi = 10.1137/0211062 | s2cid = 8517995 | url = http://wrap.warwick.ac.uk/46312/1/WRAP_Smyth_cs-rr-014.pdf }} * {{cite book |author1=Leclerc, Francois |author2=Paulin-Mohring, Christine|author2link = Christine Paulin-Mohring | title = Programming with Streams in Coq: A Case Study: the Sieve of Eratosthenes | series = Types for Proofs and Programs: International Workshop TYPES '93. | year = 1993 | isbn = 978-3-540-58085-0 | pages = 191β212 | url = http://dl.acm.org/citation.cfm?id=189973.189981 | publisher = Springer-Verlag New York, Inc. }} {{refend}} [[Category:Theoretical computer science]] [[Category:Self-reference]] [[Category:Articles with example Haskell code]] [[Category:Articles with example Python (programming language) code]] [[Category:Functional programming]] [[Category:Category theory]] [[Category:Recursion]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)