Re: Patent for relational theory for OO memory management?

From: Brian <brian_at_selzer-software.com>
Date: Fri, 4 Sep 2009 04:55:15 -0700 (PDT)
Message-ID: <1de65922-adf4-4f1f-85d1-ff7b2648d052_at_37g2000yqm.googlegroups.com>


On Sep 4, 2:59 am, Nilone <rea..._at_gmail.com> wrote:
> Not sure what to make of this:
>
> USPTO Application #: 20080222602
> Title: Declarative object identity using relation types
> Abstract: The present invention provides a programming model based on
> a relational view of the heap which defines identity declaratively,
> obviating the need for equals( ) and hashcode( ) methods. Each element
> in the heap (called a tuple) belongs to a relation type and relates an
> immutable identity to mutable state. The model entails a stricter
> contract: identity never changes during an execution. Objects, values,
> and singletons arise as special cases of tuples. (end of abstract)
>
> http://www.freshpatents.com/Declarative-object-identity-using-relatio...

Looks like someone's trying to cash in on the idiocy at the patent office. Received on Fri Sep 04 2009 - 13:55:15 CEST

Original text of this message