From: xorquewasp@googlemail.com
Subject: SPARK and unbounded tree structures
Date: Wed, 10 Jun 2009 09:52:28 -0700 (PDT)
Date: 2009-06-10T09:52:28-07:00 [thread overview]
Message-ID: <06f0b9ca-3c00-44e8-9a52-63c840ed0abe@21g2000vbk.googlegroups.com> (raw)
I'm going to be working on a compiler for a domain-specific functional
language soon. For obvious reasons, I'd like to use SPARK, if
possible.
The problem: The compiler is inevitably going to involve tree
structures
of a completely unbounded size. It's also inevitably going to involve
variant records.
Are there any real world examples of using SPARK in situations that
involve large dynamic data structures? As far as I can tell given my
week
or so of experience with SPARK, this would basically involve --# hide -
ing
most of the program and would essentially make the whole exercise
pointless.
next reply other threads:[~2009-06-10 16:52 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2009-06-10 16:52 xorquewasp [this message]
2009-06-11 7:35 ` SPARK and unbounded tree structures Rod Chapman
2009-06-11 8:28 ` Phil Thornley
2009-06-11 8:43 ` xorque
2009-06-11 10:31 ` Stephen Leake
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox