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...
主要な著者: | Ong, C, Ramsay, S, ACM |
---|---|
フォーマット: | Conference item |
出版事項: |
2011
|
類似資料
-
Verifying Higher−Order Functional Programs with Pattern Matching Algebraic Data Types
著者:: Ong, C, 等
出版事項: (2011) -
Verifying higher-order functional programs with pattern-matching algebraic data types
著者:: Ong, C, 等
出版事項: (2010) -
Verifying higher-order concurrency with data automata
著者:: Dixon, A, 等
出版事項: (2021) -
Model checking liveness properties of higher-order functional programs
著者:: Lester, MM, 等
出版事項: (2011) -
A Verified Algebra for Linked Data
著者:: Ross Horne, 等
出版事項: (2011-07-01)