565 search results - page 78 / 113 » A (De)constructive Approach to Program Checking |
POPL
1998
ACM
14 years 27 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 ...
IFL
2005
Springer
14 years 2 months ago
2005
Springer
Polytypic functional programming has the advantage that it can derive code for generic functions automatically. However, it is not clear whether it is useful for anything other tha...
SAS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
CAV
2010
Springer
14 years 17 days ago
2010
Springer
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...
DSL
2009
13 years 6 months ago
2009
Traversals of heterogeneous object structures are the most common operations in schema-first applications where the three key issues are (1) separation of traversal specifications ...