A Graph Model for Probabilistic Computation

スポンサーリンク

概要

• 論文の詳細を見る

• We construct the reflexive graph model F_ωfor probabilistic computation corresponding to Scott's graph model P_ω and characterize the computable elements in F_ω in terms of Scott's language LAMBDA.

• 一般社団法人情報処理学会の論文
• 1989-12-25

著者

• YAMADA SHINICHI

  Waseda University

• Yamada Shinichi

  Waseda University:nihon Unisys Ltd.

• KIKYO HIROTAKA

  Waseda University

関連論文

• The System FL_<m,n> for Specification Analysis and its Completeness Theorem
• A Graph Model for Probabilistic Computation

スポンサーリンク