Re: lynx-dev Wishlist item: semi-persistent session cookies

[Al Gilman]

At 07:30 PM 2002-03-02 , David Combs wrote:
>On Sat, Feb 16, 2002 at 10:27:51AM -0500, Al Gilman wrote:
>...
>> 
>> This is callability engineering not beyond what Lynx could absorb.
>> 
>> Al
>
>What is "callability engineering"?
>

Making the tool available in a form which can conveniently be called from other 
programs.  

It does mean violating what Fote always said about "Lynx is not a file viewer." 
 I can get Eudora to call Lynx to process HTML in MIME if the disposition says 
"attatchment" but if it says "Disposition: inline" I can't get Eudora to use 
Lynx for that.  <frown/>  Pardon my neoColloquialism.  If Lynx were to publish 
a DLL interface and not just a DOS command line interface we might turn that 
around.

That sort of thing.  IE the component vs. IE the Ap.

Ah -- I found it: componentization.  Google that.

But check out the Common Component Architecture, not the branded strains.

Al

>---
>Google finds nothing on "callability engineering",
>
>and about "callability",
>
>99% of what it finds is about bonds!
>
>(except one article on "formal callability":
>
>
> Linkname: ICCL 98: Abstract: Formal Callability and its Relevance 
>     and Application to Interprocedural Data-flow Analysis
> URL: http://www.computer.org/proceedings/iccl/8454/84540252abs.htm
> 
>For whatever it might be worth, its Abstract:
>
>
>
>
>  Formal Callability and its Relevance and Application to Interprocedural
>  Data-flow Analysis
>
>     Jens Knoop
>     Universitaet Passau
>
>     Formal callability is the problem of determining for every formal
>     procedure call of a program the set of procedures it may call at
>     run-time. This information is the key for constructing the
>     procedure call graph of a program, a common prerequisite of static
>     analyses of programs with procedures. Moreover, under specific
>     side-conditions it reduces in interprocedural data-flow analysis
>     the analysis of programs with formal procedure calls to the
>     analysis of programs without formal calls by treating formal calls
>     as higher-order branch statements. We demonstrate that formal
>     callability yields as a by-product the solution of the well-known
>     formal reachability problem. This directly implies that formal
>     callability is in general not decidable. However, we show that
>     formal callability is decidable for programs, where formal
>     procedure parameters do not occur in procedures, which are local
>     to the procedure of their declaration (usually known as programs
>     without global (formal) procedure parameters), but within a time
>     bound which is exponential in the program size. Thus, we
>     complement the new decidability result by introducing in addition
>     a safe approximation of formal callability called potential
>     passability, which can efficiently be computed. Moreover, for
>     programs of mode depth 2 (i.e., formal procedures do not have
>     procedures as parameters) without global procedure parameters,
>     formal callability and potential passability coincide.
>

>     Keywords: Formal callability, formal reachability, call graph
>     analysis, interprocedural data-flow analysis, program
>     optimization.
>
>     Proceedings of the 1998 International Conference on Computer
>     Languages 
>     Copyright (c) 1998 Institute of Electrical and Electronics
>     Engineers, Inc. All rights reserved.
>       _____________________________________________________________
>
>References
>
>   1. http://www.computer.org/proceedings/iccl/8454/8454toc.htm#84540252
>   2. http://dlib.computer.org/conferen/iccl/8454/pdf/84540252.pdf
>
>
>
>David
>
>
>; To UNSUBSCRIBE: Send "unsubscribe lynx-dev" to address@hidden
> 

; To UNSUBSCRIBE: Send "unsubscribe lynx-dev" to address@hidden