hig.sePublications
EnglishSvenskaNorsk
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A While Program Normal Form Theorem in Total Correctness
Uppsala universitet, Filosofiska institutionen.
2009 (English)In: Relations and Kleene Algebra in Computer Science / [ed] Rudolf Berghammer, Ali Mohamed & Bernhard Möller, Heidelberg etc.: Springer , 2009, p. 322-336Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Heidelberg etc.: Springer , 2009. p. 322-336
Series
Lecture Notes in Computer Science (LNCS) ; 5827
National Category
Philosophy
Identifiers
URN: urn:nbn:se:hig:diva-45130ISBN: 978-3-642-04638-4 (print)OAI: oai:DiVA.org:hig-45130DiVA, id: diva2:1881596
Conference
RelMiCS/AKA 2009
Available from: 2010-03-02 Created: 2024-07-03Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

Solin, Kim

Search in DiVA

By author/editor
Solin, Kim
Philosophy

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.46.0
|
WCAG
|
University Library in Gävle
|
Research at the University
|
Publish in DiVA