BibTeX record conf/tcs/NipkowW83

download as .bib file

@inproceedings{DBLP:conf/tcs/NipkowW83,
  author       = {Tobias Nipkow and
                  Gerhard Weikum},
  editor       = {Armin B. Cremers and
                  Hans{-}Peter Kriegel},
  title        = {A decidability result about sufficient-completeness of axiomatically
                  specified abstract data types},
  booktitle    = {Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany,
                  January 5-7, 1983, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {145},
  pages        = {257--268},
  publisher    = {Springer},
  year         = {1983},
  url          = {https://doi.org/10.1007/BFb0009650},
  doi          = {10.1007/BFB0009650},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/tcs/NipkowW83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.