W3C home > Mailing lists > Public > public-xformsusers@w3.org > October 2019

Re: On the Expressive Power of Declarative Constructs in Interactive Document Scripts

From: Guntur Wiseno Putra <gsenopu@gmail.com>
Date: Tue, 1 Oct 2019 22:32:50 +0700
Message-ID: <CAKi_AEtn-L=JmFiVcwgZSJhAv3iYQp5QuuUnDYFs+XGQpD4ncg@mail.gmail.com>
To: Steven Pemberton <steven.pemberton@cwi.nl>
Cc: XForms <public-xformsusers@w3.org>
Dear XForm Users and Steven,

To share what may be inspiring:

It is known that there are architectures of machines and systems regarding
with computing technologies: does it sound fantastic if there is a language
supporting those architectures...? --a language by which we may work out
the architectures...? --thus we may build or renovate machines and systems
using the language...?

Of a reading, "architecture" consists elements "form", "space", and
"order": does XForm language -- together with, if there are,  XSpace and
XOrder-- embody part of such an architectural programme...? --or at least
potentially...?


Regard,
Guntur Wiseno Putra

Pada Selasa, 01 Oktober 2019, Steven Pemberton <steven.pemberton@cwi.nl>
menulis:

> It struck me that we should be making a collection of references to all
> papers about XForms.
>
> Please reply to this message with examples you know that should be
> included. I will collect them all together.
>
> Thanks!
>
> Steven
>
>
> On Tue, 01 Oct 2019 15:40:30 +0200, Steven Pemberton <
> steven.pemberton@cwi.nl> wrote:
>
> By John Boyer.
>>
>> Contains an XForms implementation of quicksort.
>>
>> ABSTRACT
>> It is difficult to generally compare the succinctness of declarative
>> versus imperative programming as source code size varies. In imperative
>> programs, basic operations have constant cost, but they
>> tend to be more verbose than declarative programs, which increases
>> the potential for defects. This paper presents a novel approach for a
>> generalized comparison by transforming the problem into comparing
>> executed code size of a benchmark imperative algorithm with
>> a partially declarative variant of the same algorithm. This allows
>> input size variation to substitute for source code size variation. For
>> implementation, we use a multiparadigm language called XForms
>> that contains both declarative XPath expressions and imperative
>> script actions for interacting with XML data within web and office
>> documents. A novel partially declarative variant of the quicksort is
>> presented. Amortized analysis shows that onlyO(n) imperative actions are
>> executed, so the expressive power of the declarative constructs is at least
>> Ω(logn). In general, declarative constructs can
>> have an order of magnitude expressive power advantage compared
>> with only using basic imperative operations. The performance cost
>> factor of the expressive power advantage was determined to be
>> O(log2 n) based on a novel dynamic projection from the generalized tree
>> structure of XML data to a height balanced binary tree.
>>
>> https://dl.acm.org/results.cfm?within=owners.owner%3DHOSTED&
>> srt=_score&query=10.1145%2F3342558.3345397&Go.x=0&Go.y=0
>>
>
>
Received on Tuesday, 1 October 2019 15:33:14 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:37:52 UTC