Subrecursive Programming Systems

Complexity & Succinctness

  • James S. Royer
  • John Case

Part of the Progress in Theoretical Computer Science book series (PTCS)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Introduction

    1. James S. Royer, John Case
      Pages 1-18
  3. A Subrecursion Programming Systems Toolkit

    1. Front Matter
      Pages 19-19
    2. James S. Royer, John Case
      Pages 21-30
    3. James S. Royer, John Case
      Pages 31-55
    4. James S. Royer, John Case
      Pages 56-94
    5. James S. Royer, John Case
      Pages 95-104
    6. James S. Royer, John Case
      Pages 105-112
    7. James S. Royer, John Case
      Pages 113-121
    8. James S. Royer, John Case
      Pages 122-127
    9. James S. Royer, John Case
      Pages 128-151
  4. Program Succinctness

    1. Front Matter
      Pages 153-153
    2. James S. Royer, John Case
      Pages 155-161
    3. James S. Royer, John Case
      Pages 162-190
    4. James S. Royer, John Case
      Pages 191-199
    5. James S. Royer, John Case
      Pages 200-220
    6. James S. Royer, John Case
      Pages 221-222
  5. Back Matter
    Pages 223-253

About this book

Keywords

Lisp algorithm algorithms automata complexity complexity theory formal language language object-oriented programming (OOP) programming programming language simulation

Authors and affiliations

  • James S. Royer
    • 1
  • John Case
    • 2
  1. 1.School of Computer and Information Sciences, Center for Science & TechnologySyracuse UniversitySyracuseUSA
  2. 2.Computer And Information SciencesUniversity of DelawareNewarkUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-0249-3
  • Copyright Information Birkhäuser Boston 1994
  • Publisher Name Birkhäuser, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-6680-8
  • Online ISBN 978-1-4612-0249-3
  • About this book