Verifying Higher-Order Functional Programs with Pattern-Matching Algebraic Data Types
Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a promising approach to the verification of functional programs.We introduce pattern-matching recursion schemes (PMRS) as an accurate model of computation for functional programs that manipulate algebrai...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
2011
|
Search Result 1
Verifying Higher−Order Functional Programs with Pattern Matching Algebraic Data Types
Publicerad 2011
Conference item
Search Result 2
Verifying higher-order functional programs with pattern-matching algebraic data types
Publicerad 2010
Journal article