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
Search Result 1
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
Search Result 2
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
सभी संस्करण दिखाएं (3)

समान संसाधन