Cited in
(34)- Automata, Logic and Games for the $$\lambda $$ -Calculus
- RustHorn: CHC-based verification for Rust programs
- Constraint-based relational verification
- Counterexample-guided partial bounding for recursive function synthesis
- Predicate abstraction and CEGAR for disproving termination of higher-order functional programs
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- On the termination problem for probabilistic higher-order recursive programs
- Almost every simply typed \(\lambda\)-term has a long \(\beta\)-reduction sequence
- Princess
- TACO
- Eldarica
- HMC
- TravMC
- C-SHORe
- Spacer
- Stardust
- TreatJS
- TravMC2
- RADA
- JayHorn
- LiquidHaskell
- Guardol
- Crust
- Rust2Viper
- nncontroller
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- RHLE Benchmarks
- A Nonstandard Functional Programming Language
- Modular verification of higher-order functional programs
- CLN2INV
- Verification of higher-order concurrent programs with dynamic resource creation
- Reasoning about algebraic data types with abstractions
- Higher-order model checking in direct style
- Streett Automata Model Checking of Higher-Order Recursion Schemes
This page was built for software: MoCHi
