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...
Główni autorzy: | Ong, C, Ramsay, S, ACM |
---|---|
Format: | Conference item |
Wydane: |
2011
|
Podobne zapisy
-
Verifying Higher−Order Functional Programs with Pattern Matching Algebraic Data Types
od: Ong, C, i wsp.
Wydane: (2011) -
Verifying higher-order functional programs with pattern-matching algebraic data types
od: Ong, C, i wsp.
Wydane: (2010) -
Verifying higher-order concurrency with data automata
od: Dixon, A, i wsp.
Wydane: (2021) -
Model checking liveness properties of higher-order functional programs
od: Lester, MM, i wsp.
Wydane: (2011) -
A Verified Algebra for Linked Data
od: Ross Horne, i wsp.
Wydane: (2011-07-01)