A fixed-point theorem for recursive-enumerable languages and some considerations about semantics of monadic programs

Istrail, Sorin

by Sorin Istrail

Reference:

Sorin Istrail, "A fixed-point theorem for recursive-enumerable languages and some considerations about semantics of monadic programs", In International Conference on Automata, Languages and programming (ICALP79), Springer, vol. 71, New York, pp. 289-303, 1979.

Bibtex Entry:

@INPROCEEDINGS{Istrail1979,
  author = {Istrail, Sorin},
  title = {A fixed-point theorem for recursive-enumerable languages and some
	considerations about semantics of monadic programs},
  booktitle = {International Conference on Automata, Languages and programming (ICALP79)},
  year = {1979},
  volume = {71},
  pages = {289--303},
  address = {New York},
  publisher = {Springer},
  owner = {Derek},
  timestamp = {2012.05.08},
  url = {http://www.brown.edu/Research/Istrail_Lab/papers/afixedpoint},
  category = {Theory of Computation}
}