1998 |
33 | | Henry G. Baker:
You Could Learn a Lot from a Quadratic: I. Overloading Considered Harmful.
SIGPLAN Notices 33(1): 30-38 (1998) |
32 | | Henry G. Baker:
You Could Learn a Lot from a Quadratic: II. Digital Dentistry.
SIGPLAN Notices 33(2): 34-39 (1998) |
31 | | Henry G. Baker:
March Möbius Madness with a Polynomial PostScript, March 32, 1998.
SIGPLAN Notices 33(3): 24-35 (1998) |
30 | | Henry G. Baker:
You Could Learn a Lot from a Quadratic: Newton Squares the Circle.
SIGPLAN Notices 33(6): 27-31 (1998) |
1997 |
29 | | Henry G. Baker:
The COMFY 6502 Compiler.
SIGPLAN Notices 32(11): 25-30 (1997) |
28 | | Henry G. Baker:
When Bad Programs Happen to Good People.
SIGPLAN Notices 32(3): 27-31 (1997) |
27 | | Henry G. Baker:
I Have a Feeling We're Not in Emerald City Anymore.
SIGPLAN Notices 32(4): 22-26 (1997) |
26 | | Henry G. Baker:
COMFY - A Comfortable Set of Control Primitives for Machine Language Programming.
SIGPLAN Notices 32(6): 23-27 (1997) |
1995 |
25 | | Henry G. Baker:
Memory Management, International Workshop IWMM 95, Kinross, UK, September 27-29, 1995, Proceedings
Springer 1995 |
24 | | Henry G. Baker:
'Use-Once' Variables and Linear Objects - Storage Management, Reflection and Multi-Threading.
SIGPLAN Notices 30(1): 45-52 (1995) |
23 | | Henry G. Baker:
CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A.
SIGPLAN Notices 30(9): 17-20 (1995) |
1994 |
22 | EE | Henry G. Baker:
Corrigenda: intersection algorithms for lines and circles.
ACM Trans. Graph. 13(3): 308-310 (1994) |
21 | | Henry G. Baker:
A "Linear Logic" Quicksort.
SIGPLAN Notices 29(2): 13-18 (1994) |
20 | | Henry G. Baker:
Thermodynamics and Garbage Collection.
SIGPLAN Notices 29(4): 58-63 (1994) |
19 | EE | Henry G. Baker:
Minimum Reference Count Updating with Deferred and Anchored Pointers for Functional Data Structures.
SIGPLAN Notices 29(9): 38-43 (1994) |
1993 |
18 | | Henry G. Baker:
Iterators: signs of weakness in object-oriented languages.
OOPS Messenger 4(3): 18-25 (1993) |
17 | | Henry G. Baker:
Equal rights for functional objects or, the more things change, the more they are the same.
OOPS Messenger 4(4): 2-27 (1993) |
16 | | Henry G. Baker:
Complex Gaussian Integers for 'Gaussian Graphics'.
SIGPLAN Notices 28(11): 22-27 (1993) |
15 | | Henry G. Baker:
'Infant Mortality' and Generational Garbage Collection.
SIGPLAN Notices 28(4): 55-57 (1993) |
1992 |
14 | | Henry G. Baker:
NREVERSAL of Fortune - The Thermodynamics of Garbage Collection.
IWMM 1992: 507-524 |
13 | | Henry G. Baker:
Critique of DIN Kernel Lisp Definition Version 1.2.
Lisp and Symbolic Computation 4(4): 371-398 (1992) |
12 | | Henry G. Baker:
A Decision Procedure for Common Lisp's SUBTYPEP Predicate.
Lisp and Symbolic Computation 5(3): 157-190 (1992) |
11 | EE | Henry G. Baker:
Computing A*B (mod N) efficiently in ANSI C.
SIGPLAN Notices 27(1): 95-98 (1992) |
10 | EE | Henry G. Baker:
Less complex elementary functions.
SIGPLAN Notices 27(11): 15-16 (1992) |
9 | | Henry G. Baker:
Inlining Semantics for Subroutines which are Recursive.
SIGPLAN Notices 27(12): 39-46 (1992) |
8 | EE | Henry G. Baker:
CONS should not CONS its arguments, or, a lazy alloc is a smart alloc.
SIGPLAN Notices 27(3): 24-34 (1992) |
7 | EE | Henry G. Baker:
The treadmill: real-time garbage collection without motion sickness.
SIGPLAN Notices 27(3): 66-70 (1992) |
6 | EE | Henry G. Baker:
Lively linear Lisp: "look ma, no garbage!".
SIGPLAN Notices 27(8): 89-98 (1992) |
1991 |
5 | | Henry G. Baker:
CLOStrophobia: its etiology and treatment.
OOPS Messenger 2(4): 4-15 (1991) |
4 | EE | Henry G. Baker:
Shallow binding makes functional arrays fast.
SIGPLAN Notices 26(8): 145-147 (1991) |
1990 |
3 | EE | Henry G. Baker:
Unify and Conquer.
LISP and Functional Programming 1990: 218-226 |
1978 |
2 | | Henry G. Baker:
Shallow Binding in LISP 1.5.
Commun. ACM 21(7): 565-569 (1978) |
1977 |
1 | | Carl Hewitt,
Henry G. Baker:
Laws for Communicating Parallel Processes.
IFIP Congress 1977: 987-992 |