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...
Autori principali: | Ong, C, Ramsay, S, ACM |
---|---|
Natura: | Conference item |
Pubblicazione: |
2011
|
Documenti analoghi
-
Verifying Higher−Order Functional Programs with Pattern Matching Algebraic Data Types
di: Ong, C, et al.
Pubblicazione: (2011) -
Verifying higher-order functional programs with pattern-matching algebraic data types
di: Ong, C, et al.
Pubblicazione: (2010) -
Verifying higher-order concurrency with data automata
di: Dixon, A, et al.
Pubblicazione: (2021) -
Model checking liveness properties of higher-order functional programs
di: Lester, MM, et al.
Pubblicazione: (2011) -
A Verified Algebra for Linked Data
di: Ross Horne, et al.
Pubblicazione: (2011-07-01)