Sciweavers

13734 search results - page 261 / 2747
» Abstractions of data types
Sort
View
SIGCSE
1998
ACM
102views Education» more  SIGCSE 1998»
15 years 10 months ago
Design patterns for data structures
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
Dung Nguyen
JISE
1998
106views more  JISE 1998»
15 years 6 months ago
Control / Data-Flow Analysis for VHDL Semantic Extraction
straction reduces the number of states necessary to perform formal verification while maintaining the functionality of the original model with respect to ifications to be verified....
Yee-Wing Hsieh, Steven P. Levitan
ICFP
2006
ACM
16 years 6 months ago
Modular generic programming with extensible superclasses
"Generics for the Masses" (GM) and "Scrap your Boilerplate" (SYB) are generic programming approaches based on some ingenious applications of Haskell type class...
Martin Sulzmann, Meng Wang
TPHOL
2009
IEEE
16 years 1 months ago
The HOL-Omega Logic
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding ...
Peter V. Homeier
CADE
2003
Springer
16 years 6 months ago
Optimizing Higher-Order Pattern Unification
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
Brigitte Pientka, Frank Pfenning