> "kayakerjess" == kayakerjess <[EMAIL PROTECTED]> writes:
kayakerjess> Hi, I have an Access Data Project (.adp) that I am
kayakerjess> trying to open and execute from Python. I am using
kayakerjess> the win32com.client, and I have successfully opened
kayakerjess> the applica
> "Sebastian" == Sebastian Bassi <[EMAIL PROTECTED]> writes:
Sebastian> On 9/30/05, Reinhold Birkenfeld <[EMAIL PROTECTED]> wrote:
>> after Guido's pronouncement yesterday, in one of the next
>> versions of Python there will be a conditional expression with
>> the following syn
>>>>> "Duncan" == Duncan Booth <[EMAIL PROTECTED]> writes:
Duncan> Chris Smith wrote:
>> What I really want to do is take four lines of conditional, and
>> put them into one, as well as blow off dealing with a 'filler'
>&g
> "Robert" == Robert Hicks <[EMAIL PROTECTED]> writes:
Robert> I need to pull data out of Oracle and stuff it into an
Robert> Excel spreadsheet. What modules have you used to interface
Robert> with Excel and would you recommend it?
Robert> Robert
For simple enough tasks, I th
> "Gordon" == Gordon Airporte <[EMAIL PROTECTED]> writes:
Gordon> I'm wondering if this is might be bad practice. Sometimes
Gordon> when I need to pass around several pieces of datum I will
Gordon> put them in a tuple, then when I need to use them in a
Gordon> receiving functio
> "Sumit" == Sumit <[EMAIL PROTECTED]> writes:
Sumit> I have scinario like I have to Create resource(in
Sumit> __init__()) Before Running a set of testcases and then In
Sumit> Testcases resources are going to used and then It will
Sumit> cleared off after Running the testcases
> "Gary" == Gary Herron <[EMAIL PROTECTED]> writes:
Gary> Erik Max Francis wrote:
>> Pierre Barbier de Reuille wrote: > > >
>>When you need some symbols in your program, what do you use in
>> Python ?
>>>
>>> For example, an object get a state. This state is more
>>> r
> Stephen Thorne <[EMAIL PROTECTED]> writes:
> On Tue, 1 Feb 2005 18:59:18 -0500, Dan Perl <[EMAIL PROTECTED]> wrote:
>> Perhaps someone will write a program to automatically follow up
>> on every [perl-python] posting? The follow-up could just
>> contain a statement like the
>>>>> Stephen Thorne <[EMAIL PROTECTED]> writes:
> On Tue, 01 Feb 2005 21:19:34 -0500, Chris Smith
> <[EMAIL PROTECTED]> wrote:
>> Falls into the 'cure worse than the disease' category. It's
>> really just a prompt to e
> "guy" == guy lateur <[EMAIL PROTECTED]> writes:
guy> Hi all, I am trying to write some code (macro's, if you like)
guy> to glue together our Office applications (mainly Word, Excel
guy> and Outlook). We have a lot of different projects going on
guy> simultaneously. The idea i
> "Devan" == Devan L <[EMAIL PROTECTED]> writes:
Devan> None of them are really indispensible. Map and filter cab
Devan> be replaced with list comprehensions. reduce is redundant
Devan> except when multiplying a series; there's a sum function
Devan> for a reason. Lambda looks c
>> My question isn't as all-encompassing as the subject would
>> suggest...
>>
>> I am almost a Python newbie, but I have discovered that I don't
>> get along with IDLE, as i can't work out how to run and rerun a
>> routine without undue messing about.
>>
>> What I
> "Michael" == Michael Hoffman <[EMAIL PROTECTED]> writes:
Michael> Greg Lindstrom wrote:
>> I hear that Perl 6 is going to have a rewrite of regular
>> expressions; it will be interesting to see what their hard work
>> produces.
Michael> From what I saw a while ago, it d
> "chris" == chris <[EMAIL PROTECTED]> writes:
chris> I have no problem writing bits of functional code to do any
chris> of the above. But for the life of me I can't see how I can
chris> hook them altogether in an OO based framework that I can
chris> build and extend (with mo
> "calfdog" == calfdog <[EMAIL PROTECTED]> writes:
calfdog> ina wrote:
>> Look up pamie it should do all the work you need. If it dosn't
>> I can send you ishyBrowser but pamie has more comunity support.
calfdog> # wait for the document to fully load
calfdog> while ie.R
> "Kevin" == Kevin <[EMAIL PROTECTED]> writes:
Kevin> I have been using java (jsp/servlets), vb/asp and perl for
Kevin> a few years. Almost all my projects are web site
Kevin> development related, and many of my clients' web sites are
Kevin> hosted on those shared web hosting
> "[diegueus9]" == [diegueus9] Diego Andrés Sanabria writes:
[diegueus9]> Hello!!! I want know if python have binary trees and
[diegueus9]> more?
The latest boost, 1.33, says it has a python wrapper for the boost
graph library.
Boost explicitely states that it's experimental, but my
> "Michele" == Michele Simionato <[EMAIL PROTECTED]> writes:
Michele> There are also my lectures at Oxford:
Michele>
http://www.reportlab.org/~andy/accu2005/pyuk2005_simionato_wondersofpython.zip
Michele>Michele Simionato
You really need to get O'Reilly to publish your s
> "Franz" == Franz Steinhaeusler <[EMAIL PROTECTED]> writes:
Franz> On 25 Feb 2005 12:38:53 +0200, Ville Vainio <[EMAIL PROTECTED]>
wrote:
Franz> Hello Ville,
>>> "Franz" == Franz Steinhaeusler
>>> <[EMAIL PROTECTED]> writes:
>>
Franz> Thank you, but it is to
> "Tom" == Tom Willis <[EMAIL PROTECTED]> writes:
Tom> Pretty slick that python can have AOP-like features sort of
Tom> out of the box.
One wonders if there will not be
py>import AOP
in the pythonic future. These decorators could lead to byzantine
trees of @.
Now, if the decorators st
> Thomas Heller <[EMAIL PROTECTED]> writes:
> [EMAIL PROTECTED] (porterboy) writes:
>> CONTEXT: I am using Emacs to edit Python code and sometimes
>> also Matlab code. When I hit in a loop of some sort,
>> Emacs usually gets the nesting indentation right, which is
>> part
> "tc" == tc <[EMAIL PROTECTED]> writes:
tc> I always used win32com.client to access excel files and parse
tc> them, save them as website, csv and so on.
tc> why exactly is it that u use ado for solving this?
tc> TC
The value of ADO would be to throw some Stupid Question La
> "Cesar" == Cesar Andres Roldan Garcia <[EMAIL PROTECTED]> writes:
Cesar> Hi How can I control an ALU from a PC using Python?
Cesar> Thanks!
Cesar> Hola...
Cesar> Como puedo controlar la ALU de un PC usando Pyhton?
Cesar> Gracias!
Cesar> -- Atentamente,
Cesa
> Diez B Roggisch <[EMAIL PROTECTED]> writes:
>> PyType_Ready but in Python the base class isn't recognised. Is
>> there anything obvious I'm missing?
> Maybe - I'd go for one of the several available python wrapper
> generators. I personally had good experiences with SIP. But
> "bonono" == bonono <[EMAIL PROTECTED]> writes:
bonono> What I don't quite understand is, if it is "obvious",
bonono> whether there is a Zen, people would still code it that
bonono> way(unless of course they want to hide it from others or
bonono> make it difficult to understa
Hi,
I've been working on some multi-dimensional lists and I've encountered some
very strange behaviour in what appears to be simple code, I'm using python
2.4.2 and IDLE. If anyone can tell me why it's behaving so strange please
let me know, any improvements to my general coding style are also
ap
> "John" == John J Lee <[EMAIL PROTECTED]> writes:
John> Guido may or may not realise it, but he seems to have been
John> managing people (in some sense of 'managing', anyway) quite
John> successfully over the past decade or so.
John> John
Just you shush!
If he hears you, he
Hola, pythonisas:
The documentation for the logging module is good, but a bit obscure.
In particular, there seems to be a lot of action at a distance.
The fact that getLogger() can actually be a call to Logger.__init__(),
which is mentioned in para 6.29.1, also bears stressing on 6.29. I
grasp
>>>>> "Diez" == Diez B Roggisch <[EMAIL PROTECTED]> writes:
Diez> Chris Smith schrieb:
>> Hola, pythonisas: The documentation for the logging module is
>> good, but a bit obscure. In particular, there seems to be a
>> lot of
> "J" == J D Leach <[EMAIL PROTECTED]> writes:
J> OK, I'm stupid. I have been unable to discern (even Googled) a
J> way to set the PYTHONDOCS variable to point to where the HTML
J> files are. What to do? I need to know the process and where
J> theses variables are stored. -- J
One thing that made little sense to me when I was first working on
this is the following variation on the original script:
#--begin test script--
import logging
forest = ["root","trunk","branch","leaf"]
lumber_jack = {forest[0] : logging.DEBUG
,forest[1] : logging.INFO
ones, and affect
> the usability of the language.
There doesn't seem to be a point of disagreement here. Programmers
often need to require certain properties to be checked at compile-time.
Others could go either way. There is no property that a program would
rationally desire to *requir
l stuff within them (in particular,
> express all algorithms).
Is it really consistent to say that postconditions allow you to express
algorithms?
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
ity implies aliasing problems, however.
We might have a terminological issue, then. I'd tend to say that
mutability definitely does imply identity, but identity doesn't imply
aliasing. Same difference.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
Darren New <[EMAIL PROTECTED]> wrote:
> Chris Smith wrote:
> > Unless I'm missing your point, I disagree with your disagreement.
> > Mutability only makes sense because of object identity (in the generic
> > sense; no OO going on here).
>
> Depends wha
nal languages are
compilable postconditions than to say the same of imperative languages.
In both cases, some statement is asserted through a description of a
means of computing it. There may be a distinction worth making here,
but I'm missing it so far.
--
Chris Smith - Lead Software Develop
Marshall <[EMAIL PROTECTED]> wrote:
> Chris Smith wrote:
> > Darren New <[EMAIL PROTECTED]> wrote:
> > > Chris Smith wrote:
> > > > Unless I'm missing your point, I disagree with your disagreement.
> > > > Mutability only makes sense beca
ybe I actually spoke to your boss, or to your nephew's best-
friend's father. If databases are capable of modeling these kinds of
relationships (and of course they are), then they are as susceptible to
"aliasing" -- in a logical sense that avoids mention of pointer -- as
anyo
< i)
> and
>x &= (1 << j)
>
> are aliased expressions for setting a particular bit in x?
I don't know about Joachim, but yes, I would.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
wouldn't be able to get away with it, for example. That said, it's also
quite possible to consider aliasing on higher levels as well; it's just
not possible to point out the lack of aliasing for higher levels of
abstraction, and thus conclude that no aliasing exists. Aliasing is
ricted untyped pointers, if it
doesn't get lucky with the capture analysis, may have to re-evaluate all
invariants in the application on any given assignment. Nevertheless,
the re-evaluation of the invariant still needs to be done.
--
Chris Smith - Lead Software Developer /Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
David Hopwood <[EMAIL PROTECTED]> wrote:
> Chris Smith wrote:
> > If checked by execution, yes. In which case, I am trying to get my head
> > around how it's any more true to say that functional languages are
> > compilable postconditions than to say the same
rch or not believing it important, I
don't know.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
ng "assignment", he seems to mean assigning a
completely new *table* value to a relation; i.e., wiping out the entire
contents of the relation and replacing it with a whole new set of
tuples. Your assignment is indeed less powerful than DML, whereas
Marshall's assignment is more p
ent;
and if that's not the case, then I would need someone to explain how to
accomplish the same goals in the new relational language; i.e. it would
need some way of expressing transformations of relations, not just
complete replacement of them with new relations that are assumed to
app
exist. The implementation is still going to deal with the aliasing
problem, which will resurface once you pass over to the other side of
the abstraction boundary.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
t does, though, have the nice property of hiding the aliasing from the
semantic model. That is interesting and worth considering, but is a
different conversation; and I don't know how to start it.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
Howdy,
I'm a college student and for one of we are writing programs to
numerically compute the parameters of antenna arrays. I decided to use
Python to code up my programs. Up to now I haven't had a problem,
however we have a problem set where we are creating a large matrix and
finding it's inver
robert wrote:
> Chris Smith wrote:
>
>>Howdy,
>>
>>I'm a college student and for one of we are writing programs to
>>numerically compute the parameters of antenna arrays. I decided to use
>>Python to code up my programs. Up to now I haven't had a pro
on in a
few places. The compiler may not need the information, but for
precisely the reason that the information is redundant, the compiler is
then able to check the consistency of the programmer in applying the
type. I won't get into precisely how useful this is, but it is
nevertheless present as an advantage to outweigh the wordiness.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
of solutions. Languages that solve
problems in ways that don't assign types to variables are not typed
languages, even if those same problems may have been originally solved
by type systems.
> Untyped and type-free mean something else: they mean no type checking
> is done.
H
ons, I guess you could say that we do solve them with types in
the LISP sense).
> Your problem doesn't exist. Just say "types" when you're amongst your
> own folks, and "static types" when you're amongst a broader audience,
> and everything's fine.
I think I've explained why that's not the case. I don't have a
complaint about anyone speaking of types. It's the confusion from
pretending that the two definitions are comparable that I'm pointing
out.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
be able to specifically identify which behaviors they
prevent, and not that there is some universal set.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
Joe Marshall <[EMAIL PROTECTED]> wrote:
>
> Chris Smith wrote:
> >
> > Knowing that it'll cause a lot of strenuous objection, I'll nevertheless
> > interject my plea not to abuse the word "type" with a phrase like
> > "dynamically ty
al reasons, but incorrect statements eventually get
corrected.
> PS. Hi Chris!
Hi! Where are you posting from these days?
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
for simplicity's sake, clearly has
both a very well-developed static type system, and a somewhat well-
developed dynamic type system. There are dynamic "type" errors that
pass the compiler and are caught by the runtime; and there are errors
that are caught by the static typ
ck typing," which fits neither of
the two definitions above. We'd probably need to modify the definition
of dynamic type systems, since most source tend to classify it as a
dynamic type system. It's getting rather late, though, and I don't
intend to think about how to do that.
sed OO
languages are subject to similar consideration, as it turns out.
I'm unsure whether to consider explicitly stored array lengths, which
are present in most statically typed languages, to be part of a "type"
in this sense or not.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
; development in Java, because we have a gigantic
existing software system written in Java and no time to rewrite it. On
the other hand, I do like proving theorems, which means I am interested
in type theory; if that type theory relates to programming, then that's
great! That's probably not the thing to say to ensure that my thoughts
are relevant to the software development "industry", but it's
nevertheless the truth.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
ed).
> Typed ("strongly typed") it is, but is it statically typed or
> dynamically typed?
So my answer is that it's not statically typed in the first case, and is
statically typed in the second case, and it intuitively appears to be
dynamically typed at least in the first
l.
Really? I can see that in a strong enough static type system, many
dynamic typing features would become unobservable and therefore would be
pragmatically excluded from any probable implementations... but I don't
see any other kind of mutual exclusion between the two.
--
Chris Smith -
strongly with "dynamically typed".
Nevertheless, the existence of languages that are clearly "both"
suggests that they should be considered separately to at least some
extent.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
s).
I suspect you'll see the Smalltalk version of the objections raised in
response to my post earlier. In other words, whatever terminology you
think is consistent, you'll probably have a tough time convincing
Smalltalkers to stop saying "type" if they did before. If
e execution environment, including
the CPU, virtual memory system, etc." as appropriate. I am aware of no
hardware environment that really accepts all possible values for all
possible operations without the potential of somehow signaling a type
violation.
--
Chris Smith - Lead Software
erations
on actual values. I suppose, though, that they do eventually happen
with primitives at the leaves of the derivation tree, so the definition
would still apply.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
ogramming languages. By doing so, we are able at
least to considerably simplify the grammar of the language, and perhaps
also to increase the "tightness" of the verification without risking
making the language grammar context-sensitive. (I'm unsure about the
second part of that st
g post. Why does it matter to
you?
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
saying that there is a well-
defined semantics for the language.
I believe that's unacceptable for several reasons, but the most
significant of them is this. It's not reasonable to ask anyone to
accept that static type systems gain their essential "type system-ness"
fro
Chris Smith <[EMAIL PROTECTED]> wrote:
> I see it as quite reasonable when there's an effort by several
> participants in this thread to either imply or say outright that static
> type systems and dynamic type systems are variations of something
> generally called a
s, of course, a very good reason to reject the idea that the
static type system for any Turing-complete language could ever perform
this same kind analysis.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
informal reasoning by programmers about their programs. That would
agree with my skepticism, but probably not with too many other people.
> An example of a form of informal reasoning that (practically) every
> programmer does daily is termination analysis.
Or perhaps you agree with my skept
pective of
static types. If you are proposing that it is also orthogonal with
respect to dynamic types, that will be a welcome step toward our goal of
a grand unified type theory, I suppose. I have heard from others in
this thread that they don't believe so. I am also interested in your
the example here.]
Programming languages do this all the time, as well. The most popular
example is the OO sense of the word polymorphism. That's all about
being able to write code that works with a range of values regardless of
(or, at least, a range that less constraining than equlity i
Chris Smith <[EMAIL PROTECTED]> wrote:
> Programming languages do this all the time, as well. The most popular
> example is the OO sense of the word polymorphism. That's all about
> being able to write code that works with a range of values regardless of
> (or, at l
Marshall <[EMAIL PROTECTED]> wrote:
> Java has a static type system.
> Java has runtime tags and tag checks.
Yes.
> The two are distinct, and neither one is less than complete
How is neither one less than complete?
--
Chris Smith - Lead Software Developer / Technical
Dr.Ruud <[EMAIL PROTECTED]> wrote:
> Chris Smith schreef:
>
> > Static types are not fuzzy
>
> Static types can be fuzzy as well. For example: a language can define
> that extra accuracy and bits may be used for the implementation of
> calculations: d = a *
to think of one as a type error being "solved",
whereas the other is not.
Anyway, you just wrote another message that is far closer to what I feel
we ought to be thinking about than my question here... so I will get to
reading that one, and perhaps we can take up this point later w
reasoning
> that fits the "type" label, and informal reasoning that doesn't.
So while I disagree in the static case, it seems likely that this is
true of what is meant by dynamic types, at least by most people in this
discussion. I'd previously classified you as not agreeing.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
ic types do, loosely speaking, have the "purpose" of
> formalizing the informal properties I'm talking about.
Static types have the property of proving ANY properties of a program
that may be proven. Certainly, research is pragmatically restricted to
specific problems that are (1) useful and (2) solvable. Aside from
that, I can't imagine any competent language designer building a type
system, but rejecting some useful and solvable feature for the sole
reason that he or she doesn't think of it as solving a type error.
> But I hardly see why such an informal characterization should bother
> you. It doesn't affect the definition of static type.
I hope I've explained how it does affect the definition of a static
type.
> This is based on the assumption that all we're talking about is
> "well-defined semantics".
Indeed. My statement there will not apply if we find some formal
definition of a dynamic type system that doesn't reduce to well-defined
semantics once you remove the intuitive bits from it.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
Marshall <[EMAIL PROTECTED]> wrote:
> I stand corrected: if one is using C and writing self-modifying
> code, then one *can* zip one's pants.
I believe you'd need quite the creative USB-based or similar peripheral
device, as well.
--
Chris Smith - Lead Software Develop
Chris F Clark <[EMAIL PROTECTED]> wrote:
> Chris Smith <[EMAIL PROTECTED]> writes:
> > I thought about this in the context of reading Anton's latest post to
> > me, but I'm just throwing out an idea.
>
> I wrote:
> > I think there is some sense
ther pesky question; if the language
"catches" it, did the error even occur, or did the expression just gain
a defined result such that domain #3 is indistinguishable from the set
of all possible inputs. I tend to agree with Chris Uppal, I suppose,
that the latter is really the case,
7;s what I've been trying to do. So far I've had only limited
success, although there is definite potential in one post by Chris Uppal
and another by Chris Clark (or maybe I'm just partial to other people
named Chris).
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
is isn't perceived as too picky. I've already conceded
that we can use "type" in a way that's incompatible with all existing
research literature. I would, however, like to retain some word with
actually has that meaning. Otherwise, we are just going to be
linguistically prevented from discussing it.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
throwing away the
details we don't care about (anything that's irrelevant to the
predicate), and applying stereotypical rules (the theorem or axiom). I
don't quite understand what you mean by substituting classes.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
ype systems and formal
type theory is to avoid confusing aspects of one field with the other.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
rmal definition of
types in the first place, and make it clear when one or the other
meaning is being used.
Hopefully, that's a fair summary of the thread to date.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
like this may be written without
making giving the development process undue difficulty by requiring ten
times as much type annotations as actual code. There are attempts that
have been made, and they don't look too awfully bad.
--
Chris Smith - Lead Software Developer / Technica
be fixed as soon as possible. Otherwise, the type system doesn't
do much good. It's also true, I suppose, that as soon as a person
realizes that their mental thought process of types is unsound, they
would want to fix it. The difference, though, is that there is then no
formal d
of problems
which people happen to think of as type problems. If type theorists
fourty years ago had limited themselves to considering what people
thought of as types back then, we'd be in a considerably worse position
today with regard to the expressive power of types in commonly used
programming languages. Hence, your implication that insisting on a
formal rather than intuitive definition is opposed to the real-world
usefulness of the field is actually rather ironic. The danger lies in
assuming that unsolved problems are unsolvable, and therefore defining
them out of the discussion until the very idea that someone would solve
that problem with these techniques starts to seem strange.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
pe
check" is a different matter, and highlights the fact that again there's
something fundamentally different about the definition of a "type" in
the static and dynamic sense.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
Pascal Costanza <[EMAIL PROTECTED]> wrote:
> Chris Smith wrote:
> > Of course zero is not appropriate as a second argument to the division
> > operator! I can't possibly see how you could claim that it is. The
> > only reasonable statement worth making is that
George Neuner wrote:
> On Sun, 25 Jun 2006 14:28:22 -0600, Chris Smith <[EMAIL PROTECTED]>
> wrote:
>
> >George Neuner wrote:
> >> >Undecidability can always be avoided by adding annotations, but of
> >> >course that would be gross overkill in the
't be formulated as a type error. And if so, what good does
it do us to talk about type errors when we already have the perfectly
good word "bug" to describe the same concept?
> Now, the example may have seemed arbitrary to you, and it was in some
> sense arbitrary.
Arbitrary i
giving much of a definition. (Unless you think that
frogs are perfectly good examples of type systems.)
Incidentally, in the case of static type systems, we define the system
(for example, using the definition given from Pierce many times this
thread), and then infer the definition of types and typ
quoting here, so I don't know exactly how this is true. Marshall
mentioned template meta-programming in C++, which is definitely Turing-
complete.
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
erations.
> The real question is, are there some programs that we
> can't write *at all* in a statically typed language, because
> they'll *never* be typable? I think there might be, but I've
> never been able to find a solid example of one.
This seems to depend
ing different depending on the kind of data. In that
case, the sufficiently powerful type system would need to have rules so
that an if statemement creates a modified type environment to take that
into account. This is different from a runtime type check, in that you
are writing explicit code tha
int it will be
> possible (and easy) to write buggy programs. Gödel!
I agree. I never said that the ideal point is achievable... only that
there is a convergence toward it. (In some cases, that convergence may
have stalled at some equilibrium point because of the costs of being
near tha
to (Y (\fa.f)) in lambda calculus,
where \ is lambda, and Y is the fixed point combinator?
--
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
--
http://mail.python.org/mailman/listinfo/python-list
1 - 100 of 123 matches
Mail list logo
