A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
From object algebras to attribute grammars

2014
*
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14
*

Synthesized

doi:10.1145/2660193.2660237
dblp:conf/oopsla/RendelBO14
fatcat:gynn5otxxnb4jh224tz7skf5ru
*Attributes**Grammar*e 0 → n { Lit } e 1 → e 2 "+" e 3 { Add } Signature trait Sig[E] { def Lit: Int ⇒ E def Add: (E, E) ⇒ E } Equations e 0. value = n e 1 .value = e 2 .value + e 3 .value*Algebra*... Add: (E, E) ⇒ E } Equations e 0. value = n e 1 .value = e 2 .value + e 3 .value*Algebra*val Alg = new Sig[Int] { def Lit = n ⇒ n def Add = (e 2 , e 3 ) ⇒ e 2 + e 3 } 4/15 Synthesized*Attributes**Grammar*...##
###
From object algebras to attribute grammars

2014
*
SIGPLAN notices
*

Synthesized

doi:10.1145/2714064.2660237
fatcat:qopvllecivc75aeljtipdz6xxe
*Attributes**Grammar*e 0 → n { Lit } e 1 → e 2 "+" e 3 { Add } Signature trait Sig[E] { def Lit: Int ⇒ E def Add: (E, E) ⇒ E } Equations e 0. value = n e 1 .value = e 2 .value + e 3 .value*Algebra*... Add: (E, E) ⇒ E } Equations e 0. value = n e 1 .value = e 2 .value + e 3 .value*Algebra*val Alg = new Sig[Int] { def Lit = n ⇒ n def Add = (e 2 , e 3 ) ⇒ e 2 + e 3 } 4/15 Synthesized*Attributes**Grammar*...##
###
Translating SQL Into Relational Algebra Tree-Using Object-Oriented Thinking to Obtain Expression Of Relational Algebra

2012
*
International Journal of Engineering and Manufacturing
*

As an interim result of the calculation, relational

doi:10.5815/ijem.2012.03.08
fatcat:mehahzcxyfcoran3blsldst53i
*algebra*tree combined with*object*-oriented model can gives us simple, intuitive notation allowing the query*to*be efficiently expressed and implemented ... When we are translating SQL into relational*algebra*, we need a simple but flexible form*to*represent the data structure involved. ... Tree Using*Object*-Oriented Thinking*to*Obtain Expression Of Relational*Algebra*Translating SQL Into Relational*Algebra*Tree Using*Object*-Oriented Thinking*to*ObtainExpression Of Relational*Algebra*...##
###
Attribute grammars are useful for combinatorics

1992
*
Theoretical Computer Science
*

The purpose of this paper is

doi:10.1016/0304-3975(92)90380-x
fatcat:eezr7g6pyraitoxz2uvceo5ita
*to*show the use of*attribute**grammars*in solving some combinatorics problems. ... Fedou,*Attribute**grammars*are useful for combinatorics, Theoretical Computer Science 98 (1992) 65-76. ... If the words coding the*objects*of 52 constitute an*algebraic*language, the main idea is*to*slightly extend the methodology of Schtitzenberger in order*to*get the q-series directly*from*the generating ...##
###
Specification of Mobile Code Systems Using Graph Grammars
[chapter]

2000
*
IFIP Advances in Information and Communication Technology
*

We define a special dass of graph

doi:10.1007/978-0-387-35520-7_3
fatcat:pxksieaohfei5bp3fh6vfkl7da
*grammars*using the concepts of objectbased systems and indude location information explicitly. ... This approach is based on graph*grammars*, that is a formal description technique that is suitable for the description of highly parallel systems, and is intuitive even for non-theoreticians. ... An*object*may know other*objects*and may have*attributes*. Each*attribute*vertex is*attributed*with a value belonging*to*an*attribute**algebra*. ...##
###
AGG: A Graph Transformation Environment for Modeling and Validation of Software
[chapter]

2004
*
Lecture Notes in Computer Science
*

AGG is a general development environment for

doi:10.1007/978-3-540-25959-6_35
fatcat:xxbpcrlcongwfpwg3scjkzjdi4
*algebraic*graph transformation systems which follows the interpretative approach. Its special power comes*from*a very flexible*attribution*concept. ... AGG graphs are allowed*to*be*attributed*by any kind of Java*objects*. Graph transformations can be equipped with arbitrary computations on these Java*objects*described by a Java expression. ... The*attribution*of nodes and arcs by Java*objects*and expressions follows the ideas of*attributed*graph*grammars*as stated in [11] and further in [14]*to*a large extent. ...##
###
The characterisation of the derivation trees of context free sets of terms as regular sets

1972
*
13th Annual Symposium on Switching and Automata Theory (swat 1972)
*

Graphs with distinguished vertices (boundary vertices or sources) 1 and 2, generated

doi:10.1109/swat.1972.26
dblp:conf/focs/Maibaum72
fatcat:pl3trzkti5gatlaei5ihljszoq
*from*e = 1 2 and the operations // (parallel-composition) and series-composition. ... Equation system for 2-colorable series-parallel graphs We let S σ,δ be the set of series-parallel graphs that satisfy Same (σ) and Diff (δ) S σ,δ be the set of those that satisfy Same and not Diff , etc …*From*... circularity if some dependency graph of T has a path*from*b*to*x ("root*attributes*") and some dependency graph of U has one*from*a*to*y. ...##
###
Unparsing RDF/XML

2002
*
Proceedings of the eleventh international conference on World Wide Web - WWW '02
*

It is also necessary

doi:10.1145/511446.511505
dblp:conf/www/Carroll02
fatcat:3plekpudmzd3rj6ftjvvz4xj7y
*to*distinguish those that are the*object*of one triple*from*those that are not the*object*of any triple. ... Thus the four*algebras*Free, Surface, Rules, Deep and the three natural homorphisms Deep Rules Surface φ φ φ , ,*from*Free into the other*algebras*express the*grammar*. ...##
###
Attribute grammar applications in prototyping LOTOS tools
[chapter]

1990
*
Lecture Notes in Computer Science
*

Going

doi:10.1007/3-540-53101-7_7
fatcat:vdqo2gdj2zao3eonrsh2nwqoxm
*from*a definition of a language and the func-tionaUty of its tools*to*an*attribute**grammar*is a discipline in need of a systematic approach, for which we give some initial material. ... As is inevitable when a system is extensively used (in our case the Cornell Synthesizer Generator), this paper also proposes extensions*to*the*attribute**grammar*formalism and its supporting systems. ... Tim Teitelbaum's group at Cornell University responded rapidly with fixes*to*our bug reports. Douglas Hofstadter provided inspiration for the composition of this paper. ...##
###
A Pragmatic Characterization of Concept Algebra

2017
*
International Journal of Software Science and Computational Intelligence
*

Taking into account the framework of denotational mathematics as seen by Yingxu Wang, in this brief note we wish

doi:10.4018/ijssci.2017070101
fatcat:pzub6kxrfnerbpcksm3bennw3y
*to*implement a possible pragmatic dimension into the*algebraic*structure of concept*algebra*... Acknowledgments My warm thanks*to*Professor Yingxu Wang (one of the most renowned international scholars of computer science) for having allowed me*to*draw up, on the basis of his remarkable works, this ... paper which had been accepted as a poster*to*be presented at the ICCI*CC 2015. ...##
###
Decidability and Tractability of Problems in Object-Based Graph Grammars
[chapter]

2002
*
Foundations of Information Technology in the Era of Network and Mobile Computing
*

*Object*-based programming languages are being widely used

*to*construct concurrent and distributed systems. ... We model

*object*-based systems as a graph

*grammars*, and analyze this property as a graph

*grammar*property. It turns out that this problem is NP-Hard. ...

*To*define

*object*-based graph

*grammars*, we have

*to*identify within a graph

*grammar*what are the

*objects*, messages and

*attributes*, and then show how

*to*specify methods within this formalism. ...

##
###
Application of SQL RAT Translation

2011
*
International Journal of Intelligent Systems and Applications
*

Index Terms -SQL, Reverse Relational

doi:10.5815/ijisa.2011.05.07
fatcat:7kuhccfl75echhpgbsv7lmhppu
*Algebra*Tree,*object*-oriented, reverse query processing, reverse manipulate processing. ... In this paper, we will show you how*to*apply this technique*to*complicated scenarios. ... INTRODUCTION We have already provided an*object*-oriented means*to*describe the relational*algebra*tree (RAT) parsed*from*the SQL statement. ...##
###
Page 1222 of Mathematical Reviews Vol. , Issue 83c
[page]

1983
*
Mathematical Reviews
*

Authors’ summary: “The problem of constructing multipass evaluators for

*attribute**grammars*is studied. ... Furthermore, the problem of constructing an optimal evaluation order is shown*to*be NP-complete. We then develop a new characterization for*attribute**grammars*evaluable in passes. ...##
###
Stochastic Object-Based Graph Grammars

2007
*
Electronical Notes in Theoretical Computer Science
*

*Object*-Based Graph

*Grammar*(OBGG) is a formal visual language suited

*to*the specification of asynchronous distributed systems based on message passing. ... This paper is a first contribution

*to*the stochastic analysis of OBGG models. OBGG models with occurrence rates associated

*to*rules are translated

*to*Stochastic Automata Networks (SAN). ... A G over Spec, and an

*attribution*function a G : aV G → U(A G ), assigning

*to*each

*attribute*-vertex a value

*from*a carrier set of A G 4 . ...

##
###
Grammatical specification of domain ontologies

2004
*
Data & Knowledge Engineering
*

The use of production rules admits recursive formation of compound categories

doi:10.1016/s0169-023x(03)00107-1
fatcat:72ssjhv5p5cdzojhy2qtqgnexi
*from*given categories subjected*to*combinability constraints. ... The method is founded theoretically on conventional context-free*grammars*. ... We would like*to*express our gratitude*to*the ONTO NT OQUE RY UE RY team, cf. [17] , for an inspiring and challenging interdisciplinary research environment. ...
« Previous

*Showing results 1 — 15 out of 9,908 results*