mann.bib

@TECHREPORT{Mann:04:towards-sharing-lcs,
  AUTHOR = {Matthias Mann},
  TITLE = {{T}owards {S}haring in {L}azy {C}omputation {S}ystems},
  INSTITUTION = {Institut f\"ur Informatik, J.W. Goethe-Universit\"at Frankfurt am Main},
  YEAR = 2004,
  TYPE = {Frank report},
  NUMBER = 18,
  MONTH = {December},
  NOTE = {Available on request}
}

@INPROCEEDINGS{Mann:04:SOS-Workshop-2004-prelim,
  AUTHOR = {Matthias Mann},
  TITLE = {Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus},
  BOOKTITLE = {Preliminary Proceedings of the Workshop on Structural Operational Semantics, SOS '04, (London, United Kingdom, August 30, 2004)},
  PAGES = {20--38},
  YEAR = 2004,
  EDITOR = {Luca Aceto AND Willem Jan Fokkink AND Irek Ulidowski},
  VOLUME = {\href{http://www.brics.dk/NS/04/1/}{NS-04-1}},
  SERIES = {\href{http://www.brics.dk/NS/04/Ref/BRICS-NS-04-Ref/}{BRICS Notes Series}},
  MONTH = AUG,
  PRESENTATION = {http://www.ki.informatik.uni-frankfurt.de/papers/mann/Talk-SOS-2004.pdf},
  SLIDES = {http://www.ki.informatik.uni-frankfurt.de/papers/mann/Talk-SOS-2004-slides.pdf},
  NOTE = {Please refer to the \href{http://www.ki.informatik.uni-frankfurt.de/papers/mann/SOS-Workshop-2004.pdf}{revised PDF}},
  KEYWORDS = {Bisimulation, Congruence, Contextual Equivalence, Non-determinism, Call-by-need Lambda Calculus},
  ABSTRACT = {
We present  a call-by-need  lambda-calculus Lambda-ND with  an erratic
non-deterministic operator pick and a non-recursive let.  A definition
of  a bisimulation  is  given, which  has  to be  based  on a  further
calculus named Lambda-Approx,  since the naive bisimulation definition
is useless.  The main result is that this bisimulation is a congruence
and contained in the contextual equivalence.

The proof is a non-trivial extension of Howe's method. This might be a
step  towards in  defining useful  bisimulation relations  and proving
them to be congruences in calculi that extend the Lambda-ND-calculus.}
}

@PHDTHESIS{Mann:05:dissertation,
  AUTHOR = {Matthias Mann},
  TITLE = {A Non-Deterministic Call-by-Need Lambda Calculus:
                  Proving Similarity a Precongruence by an Extension of Howe's Method to Sharing},
  SCHOOL = {Johann Wolfgang Goethe-Universit{\"a}t},
  YEAR = 2005,
  TYPE = {{D}issertation},
  ADDRESS = {Frankfurt},
  PDF = {http://www.ki.informatik.uni-frankfurt.de/papers/mann/Thesis.pdf},
  GERABS = {http://www.ki.informatik.uni-frankfurt.de/papers/mann/Zusammenfassung.pdf}
}

@ARTICLE{Mann:04:SOS-Workshop-2004,
  AUTHOR = {Matthias Mann},
  TITLE = {Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus},
  JOURNAL = {Electronic Notes in Theoretical Computer Science},
  YEAR = 2005,
  VOLUME = 128,
  NUMBER = 1,
  PAGES = {81--101},
  MONTH = MAY # {~4,},
  CORRIGENDUM = {http://www.ki.informatik.uni-frankfurt.de/papers/mann/Corrigendum-SOS-2004.pdf}
}

@TECHREPORT{mann-schmidt-schauss:06-sim,
  AUTHOR = {Matthias Mann AND Manfred Schmidt-Schau{\ss}},
  TITLE = {How to Prove Similarity a Precongruence in Non-Deterministic Call-by-Need Lambda Calculi},
  INSTITUTION = {Institut  f\"ur Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universit\"at Frankfurt am Main},
  TYPE = {Frank report},
  NUMBER = {22},
  YEAR = 2006,
  MONTH = {January},
  PDF = {http://www.ki.informatik.uni-frankfurt.de/papers/mann/pc_sim_ndnd_IB200106.pdf}
}

@TECHREPORT{schmidt-schauss-mann-IB31:07,
  AUTHOR = {Manfred Schmidt-Schau{\ss} and Matthias Mann},
  TITLE = {On Equivalences and Standardization in a Non-Deterministic Call-by-Need Lambda Calculus},
  INSTITUTION = {Institut  f\"ur Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universit\"at Frankfurt
 am Main},
  TYPE = {Frank report},
  NUMBER = {31},
  MONTH = {September},
  YEAR = 2008,
  DAY = 17,
  PREVIOUSVERS1 = {http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank31-approxcalc.pdf},
  PREVIOUSVERS2 = {http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank31-approxcalc-v2.pdf},
  PDF = {http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank31-approxcalc-v3.pdf}
}

@ARTICLE{mann-schmidt-schauss:10:InfComp,
  TITLE = {Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi},
  JOURNAL = {Information and Computation},
  VOLUME = {208},
  NUMBER = {3},
  PAGES = {276 - 291},
  YEAR = {2010},
  ISSN = {0890-5401},
  DOI = {DOI: 10.1016/j.ic.2009.11.003},
  URL = {http://www.sciencedirect.com/science/article/B6WGK-4XV06TY-1/2/a02c8cfe6ce489a2a7570422aa6d0c13},
  AUTHOR = {Matthias Mann and Manfred Schmidt-Schau{\ss}}
}