3738 search results - page 465 / 748 » Parametrized Logic Programming |
187
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
87
Voted
EMSOFT
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
117
Voted
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
GPCE
2009
Springer
15 years 5 months ago
2009
Springer
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
124
Voted
AOSD
2007
ACM
15 years 4 months ago
2007
ACM
Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain ...