632 search results - page 94 / 127 » Proving Invariants of Functional Programs |
177
Voted
ESOP
2006
Springer
15 years 4 months ago
2006
Springer
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to d...
186
Voted
POPL
2006
ACM
16 years 24 days ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
103
Voted
ICFP
2004
ACM
16 years 13 days ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
98
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
FOAL
2009
ACM
15 years 7 months ago
2009
ACM
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...