1805 search results - page 226 / 361 » Functional programming with structured graphs |
113
Voted
ICFP
2001
ACM
16 years 2 months ago
2001
ACM
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
120
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
155
Voted
ELP
1991
15 years 6 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
113
Voted
JOT
2007
15 years 2 months ago
2007
Programs designed from scratch often start with just a set of classes. Classes can be instantiated and so deliver the objects that are the carriers of information and function. In...
113
Voted
LCTRTS
2010
Springer
15 years 9 months ago
2010
Springer
We describe the extension of a reactive programming language with a behavioral contract construct. It is dedicated to the programming of reactive control of applications in embedd...