• DocumentCode
    2487486
  • Title

    Making sense of recursion patterns

  • Author

    Bailes, Paul ; Brough, Leighton

  • Author_Institution
    Sch. of Inf. Technol. & Electr. Eng., Univ. of Queensland, Brisbane, QLD, Australia
  • fYear
    2012
  • fDate
    2-2 June 2012
  • Firstpage
    16
  • Lastpage
    22
  • Abstract
    Recursion patterns (such as “foldr” and elaborations thereof) have the potential to supplant explicit recursion in a viable subrecursive functional style of programming. Especially however in order to be able to eschew explicit recursion entirely, even in the definition of new recursion patterns, it´s essential to identify and validate a minimal set of basic recursion patterns. The immediate plausibility of foldr is validated by its application to the implementation of functions and recursion patterns, and especially by an abstract characterization of the programming devices used in these applications used to overcome complementary information deficiencies in data and control.
  • Keywords
    functional programming; object-oriented methods; program control structures; program diagnostics; abstract characterization; complementary information deficiency; explicit recursion; foldr; immediate plausibility; programming devices; recursion patterns; subrecursive functional programming style; Abstracts; Binary trees; Computer languages; Indexing; Programming; Semantics; foldr; functional programming; recursion;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering: Rigorous and Agile Approaches (FormSERA), 2012 Formal Methods in
  • Conference_Location
    Zurich
  • Print_ISBN
    978-1-4673-1907-2
  • Type

    conf

  • DOI
    10.1109/FormSERA.2012.6229782
  • Filename
    6229782