The following pages link to Normal proofs and their grammar (Q1917086):
Displaying 9 items.
- On the expressive power of schemes (Q719245) (← links)
- Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete (Q1274981) (← links)
- A coinductive approach to proof search through typed lambda-calculi (Q2231698) (← links)
- Pre-grammars and inhabitation for a subset of rank 2 intersection types (Q2333664) (← links)
- A short note on type-inhabitation: formula-trees vs. game semantics (Q2353633) (← links)
- Counting a type's (principal) inhabitants (Q2708317) (← links)
- A unifying framework for type inhabitation (Q4993331) (← links)
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search (Q5236550) (← links)
- Partial proof terms in the study of idealized proof search (Q6648177) (← links)