The following pages link to Recursive programming with proofs (Q1190480):
Displayed 15 items.
- Automatizing termination proofs of recursively defined functions (Q1346629) (← links)
- The Inf function in the system \(F\) (Q1346636) (← links)
- A semantical storage operator theorem for all types (Q1382182) (← links)
- System ST toward a type system for extraction and proofs of programs (Q1400600) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Strong storage operators and data types (Q1805408) (← links)
- Programs from proofs using classical dependent choice (Q2482844) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- Mixed Inductive/Coinductive Types and Strong Normalization (Q3498444) (← links)
- Two extensions of system F with (co)iteration and primitive (co)recursion principles (Q3653093) (← links)
- A new deconstructive logic: linear logic (Q4372906) (← links)
- On automating the extraction of programs from proofs using product types (Q4916212) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- An ordinal measure based procedure for termination of functions (Q5940917) (← links)
- Least and greatest fixed points in intuitionistic natural deduction (Q5958300) (← links)