55 search results - page 10 / 11 » Generic proofs for combinator-based generic programs |
FLOPS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
PPDP
2005
Springer
13 years 11 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
PLDI
2010
ACM
14 years 3 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
POPL
2007
ACM
14 years 5 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
AMAST
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...