856 search results - page 32 / 172 » Dependent Types in Practical Programming |
133
click to vote
TPHOL
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract. Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for specith abstract structures by quantification o...
107
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
118
Voted
AAECC
2007
Springer
15 years 2 months 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...
130
click to vote
CC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
100
Voted
GG
2008
Springer
15 years 3 months ago
2008
Springer
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...