@MISC{POSET_2.MIZ,
  AUTHOR = {Ishida, Kazuhisa and Shidama, Yasunari and Grabowski, Adam},
  TITLE = {Definition of Flat Poset and Existence
    Theorems for Recursive Call},
  SECTION1 = {Preliminaries from Poset Theory},
  SECTION2 = {On the Product of Posets},
  SECTION3 = {Definition of Flat Poset and Poset Flattening},
  SECTION4 = {Primaries for Existence Theorems of
    Recursive Call using Flattening},
  SECTION5 = {Existence Theorem of Recursive Call for Single-equation},
  SECTION6 = {Existence Theorem of Recursive Calls for 2-equations},
  DAY = {11},
  MONTH = {February},
  YEAR = {2014},
  ADDRESS1 = {Neyagawa-shi, Osaka, Japan},
  ADDRESS2 = {Shinshu University, Nagano, Japan},
  ADDRESS3 = {University of Bia\l ystok\\ Institute of Informatics, Akademicka 2\\ 15-267 Bia\l ystok, Poland},
  SUMMARY = {This text includes definition and basic notions of
    product of posets, flat posets, flattening operation,
    and existence theorems of recursive call using flattening
    operator. Part of the article, devoted to product and flat posets
    has pure mathematical flavour, the other one builds the background
    for information-engineering approach for lists, namely recursive
    call for posets \cite{Winskel:1993}. We formalized some facts from
    Chapter 8 of this book opening the path for the next two sections
    but we concentrate on binary product of posets rather than on
    more general case.}}

@BOOK{Winskel:1993,
  AUTHOR = {Winskel, Glynn},
  TITLE = {The Formal Semantics of Programming Languages},
  PUBLISHER = {The MIT Press},
  YEAR = 1993}
