作者: Didier Galmiche
DOI: 10.1016/0304-3975(90)90199-R
关键词:
摘要: Abstract This paper describes a constructive system, based on particular typed λ-calculus with constants and λ-expressions as types. theory is principally intuitionistic type the general idea of programming proofs which means extracting programs from proofs. It can be considered basis system for automatized program sythesis by developing adapted techniques programmation. allows to partially automate construction different specifications type-driven strategy. Moreover, corresponding logical appears like good base higher-order calculus.