H ?
«
‹
←
→
›
»
Language peer sets for coq: France↑ France/1991↑ Designed 1991 ↑ 1990s languages ↑ Fifth generation↑ Post-Cold War↑ String and List Processing ↑ String and List Processing/1991↑ String and List Processing/fr ↑ coq(ID:6970/)alternate simple viewCountry: France Designed 1991 Sammet category: String and List Processing inductive proof system for Calculus of Constructions (but also for T Coquand who created the Coc, and of course the Rooster being the symbol of France etc) A higher-order proof system based on the Curry-Howard(-deBruijn) isomorphism between propositions and types, proofs and terms in a pure functional language. By restraining to constructive logic (i.e. no built-in choice axiom) it allows to extract actual programs from proofs. But, it is not reflective, and there's no way to meta-translate expressions. Related languages
References: Resources Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE  ACM portal CiteSeer CSB ncstrl jstor Bookfinder |