Journal article icon

Journal article

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

Abstract:

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 algebraic data-types. PMRS are a natural extension of higher-order recursion schemes that incorporate pattern-matching in the defining rules. This paper is concerned with the following (undecidable) verifi...

Expand abstract

Actions


Access Document


Publisher copy:
10.1145/1926385.1926453

Authors


Ramsay, SJ More by this author
Journal:
Conference Record of the Annual ACM Symposium on Principles of Programming Languages
Pages:
587-598
Publication date:
2010
DOI:
ISSN:
0730-8566
URN:
uuid:b1095b3a-7c66-4396-9f7c-9e48619192e3
Source identifiers:
328280
Local pid:
pubs:328280
Language:
English
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP