Pages that link to "Item:Q5408579"
From MaRDI portal
The following pages link to Verifying higher-order functional programs with pattern-matching algebraic data types (Q5408579):
Displayed 21 items.
- Termination criteria for tree automata completion (Q730470) (← links)
- Counterexample-guided partial bounding for recursive function synthesis (Q832233) (← links)
- Herbrand's theorem as higher order recursion (Q1987218) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- On first-order logic and CPDA graphs (Q2254514) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- Typing Weak MSOL Properties (Q2949449) (← links)
- (Q2980977) (← links)
- Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360) (← links)
- Modular Verification of Higher-Order Functional Programs (Q2988670) (← links)
- Higher-Order Model Checking in Direct Style (Q3179299) (← links)
- A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
- (Q4625705) (← links)
- (Q4993342) (← links)
- Streett Automata Model Checking of Higher-Order Recursion Schemes (Q5111330) (← links)
- (Q5208874) (← links)
- Automata, Logic and Games for the $$\lambda $$ -Calculus (Q5224488) (← links)
- Higher order symbolic execution for contract verification and refutation (Q5371996) (← links)
- Verification of tree-processing programs via higher-order mode checking (Q5740641) (← links)
- Parameterized recursive refinement types for automated program verification (Q6109429) (← links)
- Lifting numeric relational domains to algebraic data types (Q6164423) (← links)