Ada papers available for WWW browsing

Ada papers available for WWW browsing

[Henry G. Baker]

A number of papers in hypertext format relevant to Ada programming
and/or Ada implementations are now available for browsing on the World
Wide Web.  See the listing below, or link to URL
ftp://ftp.netcom.com/pub/hb/hbaker/home.html.

Henry Baker
Read (192.100.81.1) ftp.netcom.com:/pub/hb/hbaker/README for ftp-able papers.
WWW archive: ftp://ftp.netcom.com/pub/hb/hbaker/home.html
************* Note change of address ^^^        ^^^^
(It _is_ accessible, but Netcom is loaded; keep trying.)

<a href="ftp://ftp.netcom.com/pub/hb/Use1Var.html">
Use1Var.html (WWW hypertext)</a>

"'Use-Once' Variables and Linear Objects--Storage Management,
Reflection and Multi-Threading".  Submitted to ACM <cite>Sigplan
Notices,</cite> September, 1994.  A high-level discussion of 'linear'
and 'non-linear' (traditional) names/variables/objects in programming
languages.<p>

<a href="ftp://ftp.netcom.com/pub/hb/LRefCounts.html">
LRefCounts.html (WWW hypertext)</a>

"Minimizing Reference Count Updating with Deferred and Anchored
Pointers for Functional Data Structures".  ACM <cite>Sigplan Notices
29,</cite> 9 (September 1994), 38-43.  Safe mechanisms for reducing
reference count updating overhead.<p>

<a href="ftp://ftp.netcom.com/pub/hb/ObjectIdentity.html">
ObjectIdentity.html (WWW hypertext)</a>

"Equal Rights for Functional Objects or, The More Things Change, The
More They Are the Same".  ACM <cite>OOPS Messenger 4,</cite> 4
(October 1993), 2-27.  Programming language <em>types</em> should
include the notion of whether an object is mutable or immutable.<p>

<a href="ftp://ftp.netcom.com/pub/hb/LimitedRoots.html">
LimitedRoots.html (WWW hypertext)</a>

"Safe and Leakproof Resource Management using Ada83 Limited Types".
ACM <cite>Ada Letters XIII,</cite> 5 (Sep/Oct 1993), 32-42.  How to do
resource management and garbage collection <em>safely</em> 'on top of'
Ada, rather than 'underneath' (in the implementation).<p>

<a href="ftp://ftp.netcom.com/pub/hb/Encode.html">
Encode.html (WWW hypertext)</a>

"Strategies for the Lossless Encoding of Strings as Ada Identifiers".
ACM <cite>Ada Letters XIII,</cite> 5 (Sep/Oct 1993), 43-47.
Interesting ways to translate identifiers from one programming
language into another without losing readability or
distinguishability.<p>

<a href="ftp://ftp.netcom.com/pub/hb/Iterator.html">
Iterator.html (WWW hypertext)</a>

"Iterators: Signs of Weakness in Object-Oriented Languages".  ACM
<cite>OOPS Messenger 4,</cite> 3 (July 1993), 18-25. If your language
<em>requires</em> iterators in order to get anything done, your
language's control structures are grossly deficient.<p>

<a href="ftp://ftp.netcom.com/pub/hb/LimitedRobbery.html">
LimitedRobbery.html (WWW hypertext)</a>

"How to Steal from a Limited Private Account--Why Mode IN OUT
Parameters for Limited Types Must be Passed by Reference".  ACM
<cite>Ada Letters XIII,</cite> 3 (May/June 1993), 91-95. Passing IN
OUT parameters of limited type by copy-in, copy-out opens up a major
loophole in Ada's type safety, which can be closed only by requiring
that such parameters be passed by reference.<p>

<a href="ftp://ftp.netcom.com/pub/hb/Inlines.html">
Inlines.html (WWW hypertext)</a>

"Inlining Semantics for Subroutines which are Recursive".  ACM
<cite>Sigplan Notices 27,</cite> 12 (December 1992), 39-46. A
semantics for subroutine 'inlining' which handles recursive
subroutines and 'unrolls' tail-recursive loops.<p>

<a href="ftp://ftp.netcom.com/pub/hb/SigAda92Positions.html">
SigAda92Positions.html (WWW hypertext)</a>

"Ada9X Issues for AI Systems".  Issues paper for Ada/AI/RT WG
Workshop, Summer '92 SigAda Meeting, June 24-25, 1992.<p>

<a href="ftp://ftp.netcom.com/pub/hb/NoMotionGC.html">
NoMotionGC.html (WWW hypertext)</a>

"The Treadmill: Real-Time Garbage Collection without Motion Sickness".
ACM <cite>Sigplan Notices 27,</cite> 3 (March 1992), 66-70. How to do
real-time garbage collection without copying.<p>

<a href="ftp://ftp.netcom.com/pub/hb/LazyAlloc.html">
LazyAlloc.html (WWW hypertext)</a>

"CONS Should not CONS its Arguments".  ACM <cite>Sigplan Notices
27,</cite> 3 (March 1992), 24-34.  How to <em>safely</em> allocate
stuff on the stack.<p>

<a href="ftp://ftp.netcom.com/pub/hb/OOAdaLetters.html">
OOAdaLetters.html (WWW hypertext)</a>

"Object-Oriented Programming in Ada83--Genericity Rehabilitated".  ACM
<cite>Ada Letters XI,</cite> 9 (Nov/Dec 1991), 116-127.  How to do
single inheritance OO programming in Ada83 using overloading and
generics.<p>

<a href="ftp://ftp.netcom.com/pub/hb/LPprogram.html">
LPprogram.html (WWW hypertext)</a>

"Structured Programming with Limited Private Types in Ada".  ACM
<cite>Ada Letters XI,</cite> 5 (Jul/Aug 1991), 79-90.  How to program
with Ada's 'limited' (assignment-less) types.<p>

<a href="ftp://ftp.netcom.com/pub/hb/TreeShadow.html">
TreeShadow.html (WWW hypertext)</a>

"Worlds in Collision: A Mostly Functional Model of Concurrency Control
and Recovery".  Unpublished, 1990.  Shallow binding and concurrency
control.  Write-ahead and write-behind for database and transaction
recovery are simply various versions of shallow binding.<p>

<a href="ftp://ftp.netcom.com/pub/hb/Bitvectors.html">
Bitvectors.html (WWW hypertext)</a>

"Efficient Implementation of Bit-vector Operations in Common Lisp".
ACM <cite>Lisp Pointers 3,</cite> 2-4 (Apr-Jun 1990), 8-22.  How to
implement bit vector operations efficiently.<p>

<a href="ftp://ftp.netcom.com/pub/hb/RealTimeGC.html">
RealTimeGC.html (WWW hypertext)</a>

"List Processing in Real Time on a Serial Computer",
<cite>Communications of the ACM 21,</cite> 4 (April 1978), 280-294.
Discusses copying garbage collection, incremental (real-time) garbage
collection, real-time reference counting, etc.<p>

<a href="ftp://ftp.netcom.com/pub/hb/Futures.html">
Futures.html (WWW hypertext)</a>

"The Incremental Garbage Collection of Processes", with Carl Hewitt,
ACM <cite>Sigplan Notices 12,</cite> 8 (August 1977), 55-59.  An early
discussion of the concept of 'futures' in a parallel functional
programming language.  Naively uses 'reachability' for eliminating
garbage processes, which is now known to be insufficient in the
presence of shared cells with assignment.<p>