Programs, Recursion and Unbounded Choice(Cambridge Tracts in Theoretical Computer Science)

程序,递归式和无限选择

计算机软件

售   价:
408.00
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2005年08月01日
装      帧
平装
ISBN
9780521018296
复制
页      码
240
开      本
247×174×13mm
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 100 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy, developed by the author to a greater depth than has been achieved before.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个