Verifying Higher-Order Functional Programs with Pattern-Matching Algebraic Data Types

Verifying Higher-Order Functional Programs with Pattern-Matching Algebraic Data Types

他のバージョン（2件）を表示する

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

Verifying Higher−Order Functional Programs with Pattern Matching Algebraic Data Types 著者: Ong, C, Ramsay, S

出版事項 2011

Conference item

Verifying higher-order functional programs with pattern-matching algebraic data types

Verifying higher-order functional programs with pattern-matching algebraic data types 著者: Ong, C, Ramsay, S

出版事項 2010

Journal article