university website Publications by Year
  • sign in
  • Computer Security /
  • Higher-order and Symbolic Computation /
  • Article
  • Search

M. Niqui (Milad) and J.J.M.M. Rutten (Jan)

2012

A proof of Moessner's theorem by coinduction.

Publication

Publication

Higher-order and Symbolic Computation , Volume 24 - Issue 3 p. 191- 206

Additional Metadata
THEME Software (theme 1)
Publisher Springer
Journal Higher-order and Symbolic Computation
Organisation Computer Security
Citation
APA Style
  • AAA Style
  • APA Style
  • Cell Style
  • Chicago Style
  • Harvard Style
  • IEEE Style
  • MLA Style
  • Nature Style
  • Vancouver Style
  • American-Institute-of-Physics Style
  • Council-of-Science-Editors Style
  • BibTex Format
  • Endnote Format
  • RIS Format
  • CSL Format
  • DOIs only Format
Niqui, M., & Rutten, J. (2012). A proof of Moessner's theorem by coinduction. . Higher-order and Symbolic Computation, 24(3), 191–206.

university website
  • Address

    • Centrum Wiskunde & Informatica
    • Science Park 123 | 1098 XG Amsterdam | the Netherlands
  • CWI researchers

    • Register Your Work
  • Questions or comments?

    • repository@cwi.nl
artudis website

Workflow

Workflow

Add Content


User Publication Person Organisation Collection
Close