A Primitive for Non-recursive List Processing

この論文をさがす

抄録

A new LISP primitive rcons (reverse cons) is proposed which can be used to transform a certain type of recursively defined functions into iterative ones. Rcons which constructs a list in the reverse order (i.e. from head to tail) could be defined in terms of rplacd and cons. However as a new primitive instead of a composite function rcons can dispose of overheads in space and time due to rplac used inside the composite rcons in cdr-coding implementations.

A new LISP primitive rcons (reverse cons) is proposed, which can be used to transform a certain type of recursively defined functions into iterative ones. Rcons, which constructs a list in the reverse order (i.e.,from head to tail), could be defined in terms of rplacd and cons. However, as a new primitive instead of a composite function, rcons can dispose of overheads in space and time due to rplac, used inside the composite rcons, in cdr-coding implementations.

収録刊行物

詳細情報 詳細情報について

  • CRID
    1050282812870984576
  • NII論文ID
    110002673307
  • NII書誌ID
    AA00700121
  • ISSN
    18826652
  • Web Site
    http://id.nii.ac.jp/1001/00059963/
  • 本文言語コード
    en
  • 資料種別
    article
  • データソース種別
    • IRDB
    • CiNii Articles

問題の指摘

ページトップへ