632 search results - page 77 / 127 » Proving Invariants of Functional Programs |
106
Voted
AAECC
2007
Springer
15 years 20 days ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
122
Voted
ICFP
2005
ACM
16 years 15 days ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
123
click to vote
OOPSLA
2005
Springer
15 years 6 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
133
click to vote
ITA
2007
15 years 13 days ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
96
Voted
PLDI
2010
ACM
15 years 5 months ago
2010
ACM
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...