89 search results - page 7 / 18 » Canonical Abstract Syntax Trees |
106
click to vote
POPL
1993
ACM
15 years 1 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Model-driven engineering and model-based approaches have permeated all branches of software engineering; to the point that it seems that we are using models, as Molière...
LICS
1997
IEEE
15 years 1 months ago
1997
IEEE
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a cohe...
DSVIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The ConcurTaskTrees (CTT) is one of the most widely used notations for task modeling, specifically tailored for user interface model-based design. The integration of CTT ...