444 search results - page 39 / 89 » Termination by Abstraction |
POPL
2010
ACM
14 years 6 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
SAS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...