A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Partial composition and recursion of module specifications
[chapter]
1987
Lecture Notes in Computer Science
Preserved Fulltext
Here we introduce partial composition and partial actualization of module specifications, describe the connection with their "total" counterpart and prove that the result of successive partial compositions ...
The basic interconnections of module specifications (union, composition and actualization) were studied in earlier papers. ...
Many thanks also to Annette Mosley for her excellent job of typing an unreadable manuscript in record time. ...
doi:10.1007/3-540-17660-8_57
fatcat:7oq6rju7wrdtngag4i3pskmqiq
Page 3376 of Mathematical Reviews Vol. , Issue 91F
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In order to demonstrate the power of the formalism introduced, additional operations such as renaming, partial composition, recursion, product, and iteration are intro-
68 COMPUTER SCIENCE
3376
duced and ...
and module specifications. ...
Turing universality of neural nets (revisited)
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. ...
We emphasize the modular construction of nets within nets, a relevant issue from the software engineering point of view. ...
Composition For the composition schema, h(x 1 ,…,x n ) = g(f 1 (x 1 ,…,x n ),…,f k (x 1 ,…,x n )), each f i (x 1 ,…,x n ), i=1,…,k, is computed first and partial results are trapped by a Sync-k net of ...
doi:10.1007/bfb0025058
fatcat:2z72zkcvmnaljktomzlwo5qkwm
Labeling workflow views with fine-grained dependencies
2012
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Such views include composite modules and model fine-grained dependencies between module inputs and outputs. ...
Although the combination of fine-grained dependencies and recursive workflows entail, in general, long (linear-size) data labels, we show that for a large natural class of workflows and views, labels are ...
: the depth of nested composite modules (default = 4); and (4) recursion length: the number of composite modules in a recursion (default = 2). ...
doi:10.14778/2350229.2350240
fatcat:k7boqmpei5eb7otercmn4u45ke
Labeling Workflow Views with Fine-Grained Dependencies
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Such views include composite modules and model fine-grained dependencies between module inputs and outputs. ...
Although the combination of fine-grained dependencies and recursive workflows entail, in general, long (linear-size) data labels, we show that for a large natural class of workflows and views, labels are ...
: the depth of nested composite modules (default = 4); and (4) recursion length: the number of composite modules in a recursion (default = 2). ...
arXiv:1208.0083v1
fatcat:zebkuj4q6zapjkqkpiyn5odreq
Eliminating distinctions of class
2006
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Prototypes are similar in power to dependent types, and subtyping is shown to be a form of partial evaluation. ...
Virtual classes and feature oriented programming are techniques which extend the mechanism of inheritance so that it is possible to refine nested classes as well. ...
Acknowlegements We would like to acknowledge the help of Phil Wadler and Don Batory, who provided comments and discussion on earlier drafts of this paper. ...
doi:10.1145/1167473.1167475
dblp:conf/oopsla/Hutchins06
fatcat:ov6ethsekna5dfgh2hcidcfbwy
Cumulative subject index
1988
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
multiplicative inverses in GF(2m), 78, 171 Bisimulation weak and strong, automata, 79, 60 effective objects, partial morphisms in, 76, 250 partial maps, theory, 79. 95 Clocks synchronization, fault-tolerant ...
trade-08 between page number and page width, 79, 155 Bounds lower, derivation for simulation of queue, stacks, and tapes, 78, 56 upper and lower, definition for computation of square parts of integers ...
01-derivations of
high-level grammars, 78, 187
Pebble, for modules and abstract data
types, 76, 278
real-time distributed, compositional se-
mantics, 79, 210
regular, star height and relative star ...
doi:10.1016/0890-5401(88)90023-5
fatcat:xnrqpyeuefaepjhrbx4w5pqz4e
Page 1065 of Mathematical Reviews Vol. , Issue 91B
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
simulation and transformation, and a realization concept of interface by module specifications. ...
Summary: “The theory of algebraic module specifications with horizontal structuring operations, like composition, actualization and union, is extended by vertical development steps, like refine- ment, ...
A semantic approach to program modularity
1984
Information and Control
Preserved Fulltext
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.
In a local modular system the correctness of each module can be established by only looking at the module specifications, i.e., without using any information about how the modules are implemented. ...
A characterization of locality is given, and the locality of hierarchical and recursive modular systems is studied. ...
ACKNOWLEDGMENT We would like to thank Pekka Orponen and Henry Tirri for fruitful discussions on the themes treated in this paper. RECEIVED: December 7, 1982; ACCEPTED: May 1, 1984 ...
doi:10.1016/s0019-9958(84)80026-1
fatcat:4wrk5olnpjglxgcilecs2nvhuu
Page 5691 of Mathematical Reviews Vol. , Issue 93j
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
For a linear hierarchy of modules and interfaces, M,, I;, M2, 1In,---,Mn,In, we present the following composition theorem: If M, offers J; and, for i = 2,---,n, M; using J;_, offers J;, then the hierarchy ...
(D-TUB-I)
Algebraic specification of action trees and recursive processes. (English summary)
Tree automata and languages (Le Touquet, 1990), 235-290, Stud. Comput. Sci. Artif. ...
PDiffView
2009
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGEMENTS This work was supported by NSF grant number IIS 0513778, SEII 0612177 and IIS 0803524. ...
We therefore allow users to group modules of the specification into composite modules. By applying grouping recursively, a hierarchy of composite modules can be formed. ...
By recursively grouping modules, the user can create a well-nested hierarchy of composite modules over the specification, defining the levels at which differences between runs can be viewed. ...
doi:10.14778/1687553.1687612
fatcat:znbji3fefrg4bfoskz37uygmxe
Fundamentals of algebraic specifications 2, module specifications and constraints
1990
Science of Computer Programming
Preserved Fulltext
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.
The key topics of this volume under review are module specifications 2nd their interconnections, as means for the algebraic specification of modular systems, and their structuring and constraints as second ...
It starts with a short historical review of the roots from which the suggested concept of module specification arose. It is mainly ...
In order to demonstrate the power of the introduced formalism, additional operations like renaming, partial composition, recursion, product, and iteration are introduced and the main correctness and compositionality ...
doi:10.1016/0167-6423(90)90052-f
fatcat:q4vmoehzozbebmn7bw3isy2rae
Labeling recursive workflow executions on-the-fly
2011
Proceedings of the 2011 international conference on Management of data - SIGMOD '11
Preserved Fulltext
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.
We first show that, in general, for workflows that contain recursion, dynamic labeling of executions requires long (linear-size) labels. ...
We first show that, in general, for workflows that contain recursion, dynamic labeling of executions requires long (linearsize) labels. ...
This work was supported in part by the US National Science Foundation grants IIS-0803524 and IIS-0629846, by the Israel Science Foundation, by the US-Israel Binational Science Foundation, and by the EU ...
doi:10.1145/1989323.1989375
dblp:conf/sigmod/BaoDM11
fatcat:3vcn4n3r7vgfpcudizfshmowx4
Software radio architecture: a mathematical perspective
1999
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The bounded recursive functions, a subset of the total recursive functions, are shown to be the largest class of Turing-computable functions for which software radios exhibit provable stability in plug-andplay ...
Understanding the topological properties of the software radio architecture promotes plug-and-play applications and cost-effective reuse. ...
subset of the partial recursive functions. ...
doi:10.1109/49.761033
fatcat:lys4vi3tobgm5kbphoewvjery4
Page 5989 of Mathematical Reviews Vol. , Issue 94j
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
5989
“We present these precondition functions for a language with operators for sequential composition, unbounded demonic choice and recursive procedures. ...
We give a correctness criterion for this partial evaluator and prove its correctness relative to this specification. ...
« Previous
Showing results 1 — 15 out of 25,526 results