摘要: Proving a theorem in intuitionistic propositional logic, with implication as its single connective, is known as one of the simplest to state PSPACE-complete problem. At the same time, via the Curry-Howard isomorphism, it is instru... 展开
作者 | Paul Tarau | ||
---|---|---|---|
作者单位 | |||
文集名称 | Practical aspects of declarative languages | ||
出版年 | 2019 | ||
会议名称 | ACM SIGPLAN symposium on principles of programming languages;International symposium on practical aspects of declarative languages | ||
页码 | 115-132 | 开始页/总页数 | 00000115 / 18 |
会议地点 | Lisbon(PT) | 会议年/会议届次 | 2019 / 46th;21st |
关键词 | Curry-Howard isomorphism Propositional implicational intuitionistic logic Type inference and type inhabitation Simply typed lambda terms Logic programming Propositional theorem provers Combinatorial testing algorithms | ||
馆藏号 | P1900408 |