Subrecursive programming systems - complexity and succinctness

@inproceedings{Royer1994SubrecursivePS,
  title={Subrecursive programming systems - complexity and succinctness},
  author={James S. Royer and James Case},
  year={1994}
}

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS

0 51 20 65 v 1 1 5 D ec 2 00 5 Tradeoffs in Metaprogramming

VIEW 6 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Tradeoffs in metaprogramming

VIEW 6 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Rice and Rice-Shapiro Theorems for transfinite correction grammars

  • Math. Log. Q.
  • 2011
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND

A Solution to Wiehagen’s Thesis

  • Theory of Computing Systems
  • 2016