289 search results - page 48 / 58 » Program transformation by templates based on term rewriting |
POPL
1998
ACM
14 years 20 days ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
We present a paradigm for uniting the diverse strands of XML-based Web technologies by allowing them to be incorporated within a single document. This overcomes the distinction be...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
ESOP
2007
Springer
14 years 9 days ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...