171 search results - page 31 / 35 » Transforming Syntactic Graphs into Semantic Graphs |
IANDC
2006
14 years 9 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
INFORMATICALT
2007
14 years 9 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
110
click to vote
TFM
2009
Springer
15 years 4 months ago
2009
Springer
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
155
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
In order to optimize their revenues and profits, an increasing number of businesses organize their business activities in terms of business processes. Typically, they automate imp...
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...