Re: LSP
- From: "Daniel T." <daniel_t@xxxxxxxxxxxxx>
- Date: Fri, 22 Feb 2008 20:15:01 -0500
S Perryman <q@xxxxx> wrote:
Completeness and decidability are the ultimate arbiters of proof systems.
Given any two types, it is easy to discern wither one is substitutable
for the other and once a type is defined, the properties that determine
if it is substitutable for another type are immutable, so I see no
problem.
.
- Prev by Date: Re: Retrieving unnecessary data
- Next by Date: Re: Why is Object Oriented so successfull
- Previous by thread: Required 6 Oracle Programmers {GC/Citizens}
- Next by thread: Re: LSP
- Index(es):
