The following pages link to Proofs as programs (Q3219093):
Displaying 18 items.
- Synthesis of list algorithms by mechanical proving (Q485837) (← links)
- Proof methods of declarative properties of definite programs (Q685395) (← links)
- Formal proof of a program: find (Q858911) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- Generalization from partial parametrization in higher-order type theory (Q1122980) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Enumerating \(k\)-way trees (Q1313764) (← links)
- Proofs as processes (Q1342245) (← links)
- Proofs and programs (Q1408657) (← links)
- Automated higher-order complexity analysis (Q1827392) (← links)
- The effects of effects on constructivism (Q2133168) (← links)
- Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language (Q2947456) (← links)
- (Q5087785) (← links)
- From programming-by-example to proving-by-example (Q5096230) (← links)
- What Is the Difference Between Proofs and Programs? (Q5246110) (← links)
- A machine program for theorem-proving (Q5621961) (← links)
- A higher-order interpretation of deductive tableau (Q5938542) (← links)
