110 search results - page 19 / 22 » Matching Objects Without Language Extension |
HLPPP
1991
15 years 29 days ago
1991
Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computati...
101
click to vote
SIGMOD
2010
ACM
14 years 7 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
OOPSLA
2005
Springer
15 years 2 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
104
click to vote
SAC
2010
ACM
15 years 4 months ago
2010
ACM
A software product line (SPL) is a set of software systems with well-defined commonalities and variabilities that are developed by managed reuse of common artifacts. In this pape...
105
click to vote
ASPLOS
2004
ACM
15 years 2 months ago
2004
ACM
Embedded software must meet conflicting requirements such as being highly reliable, running on resource-constrained platforms, and being developed rapidly. Static program analysi...