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)