Program operators for composing abstractions

Data processing: software development – installation – and managem – Software program development tool – Managing software components

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07146604

ABSTRACT:
Programming abstractions with at least one expression are composed to a single abstraction using a composition operator. Expressions from the abstractions are unfolded by removing the prefix of each abstraction and substituting formal parameter names in each expression with a common parameter name to define open variables. The unfolded expressions are transformed to a reduced expression using a composition pattern that tunes semantics of the composition operators. The reduced expression is nested in the single abstraction by: appending a selected prefix of the composed abstraction to the reduced expression, binding the open variables of the reduced expression to the formal parameter of the selected prefix, and computing the type of the formal parameter of the selected prefix.

REFERENCES:
patent: 6308187 (2001-10-01), DeStefano
patent: 6374402 (2002-04-01), Schmeidler et al.
patent: 6473895 (2002-10-01), Lopes et al.
patent: 2002/0089541 (2002-07-01), Orbanes et al.
patent: 2004/0148592 (2004-07-01), Vion-Dury
L. Cardelli and P. Wegner, “On understanding data types, data abstraction, and polymorphism”, in ACM Computing Surveys, 17:471-522, Dec. 1985.
Circus-DTE Factsheet, available on the Internet at http://alphaave.com/staging/Xerox/Circus-DTE/tutorial/factsheet.pdf, in 2002.
Circus-DTE Tutorial, available on the Internet at http://alphaave.com/staging/Xerox/Circus-DTE/tutorial/tutorial.pdf in 2002.
J. Magee, J. Kramer, and N. Dullay, “Darwin/mp: An environment for parallel and distributed programming”, in proceedings of 26th HICSS, vol. II (Software Technology), Jan. 1993.
R. Milner, “Operational and Algebraic Semantic of Concurrent Processes”, in vol. 2, chapter Chap. 19, Handbook of Theoretical computer Science. Elsevier Publishers B.V., 1990.
G. D. Plotkin, “A structural approach to operational semantics”, in Technical Report DAIMI-FN-19, Computer Sciences Dept, Arhus university, Denmark, 1981. (available on the Internet at http://www.dcs.ed.ac.uk/home/gdp/publications/).
M. Shaw, “Procedure calls are the assembly language of systems interconnection: Connectors deserve first-class statues”, in Proceedings of the Workshop on Studies of Software Design, May 1993.
Eugene Shcherbatyuk, “A language extension for programming abstractions without objects”, Oct. 29, 2001, published on the Internet at http://www.modulaware.com/mdlt/mdlt84.htm.
“Towards The Clarification Of The Object-Oriented Concepts”, available on the Internet at http://www.doc.mmu.ac.uk/STAFF/J.Gray/oopslang/aoblnts/intro/OOPCONCP.HTM, in 2002.
U.S. Appl. No. 10/046,314, entitled “Symmetrical Structural Pattern Matching” (D/A0858).
U.S. Appl. No. 10/046,191, entitled “Bi-Valuation Of Programming Statements” (D/A0858Q).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Program operators for composing abstractions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Program operators for composing abstractions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Program operators for composing abstractions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3698347

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.