Henry G. Baker - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

1998

You Could Learn a Lot from a Quadratic: I. Overloading Considered HarmfulHenry G. Baker. SIGPLAN, 33(1):30-38, 1998.

You Could Learn a Lot from a Quadratic: II. Digital DentistryHenry G. Baker. SIGPLAN, 33(2):34-39, 1998.

March Möbius Madness with a Polynomial PostScript, March 32, 1998Henry G. Baker. SIGPLAN, 33(3):24-35, 1998.

You Could Learn a Lot from a Quadratic: Newton Squares the CircleHenry G. Baker. SIGPLAN, 33(6):27-31, 1998.

1997

The COMFY 6502 CompilerHenry G. Baker. SIGPLAN, 32(11):25-30, 1997.

COMFY - A Comfortable Set of Control Primitives for Machine Language ProgrammingHenry G. Baker. SIGPLAN, 32(6):23-27, 1997.

When Bad Programs Happen to Good PeopleHenry G. Baker. SIGPLAN, 32(3):27-31, 1997.

I Have a Feeling We re Not in Emerald City AnymoreHenry G. Baker. SIGPLAN, 32(4):22-26, 1997.

1995

CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.AHenry G. Baker. SIGPLAN, 30(9):17-20, 1995.

Use-Once Variables and Linear Objects - Storage Management, Reflection and Multi-ThreadingHenry G. Baker. SIGPLAN, 30(1):45-52, 1995.

1994

Corrigenda: intersection algorithms for lines and circlesHenry G. Baker. tog, 13(3):308-310, 1994. [doi]

A Linear Logic QuicksortHenry G. Baker. SIGPLAN, 29(2):13-18, 1994.

Thermodynamics and Garbage CollectionHenry G. Baker. SIGPLAN, 29(4):58-63, 1994.

Minimum Reference Count Updating with Deferred and Anchored Pointers for Functional Data StructuresHenry G. Baker. SIGPLAN, 29(9):38-43, 1994. [doi]

Linear logic and permutation stacks - the Forth shall be firstHenry G. Baker. sigarch, 22(1):34-43, 1994. [doi]

1993

Infant Mortality and Generational Garbage CollectionHenry G. Baker. SIGPLAN, 28(4):55-57, 1993.

Complex Gaussian Integers for Gaussian Graphics Henry G. Baker. SIGPLAN, 28(11):22-27, 1993.

Iterators: signs of weakness in object-oriented languagesHenry G. Baker. oopsm, 4(3):18-25, 1993.

Equal rights for functional objects or, the more things change, the more they are the sameHenry G. Baker. oopsm, 4(4):2-27, 1993.

Sparse polynomials and linear logicHenry G. Baker. cca, 27(4):10-14, 1993. [doi]

1992

Inlining Semantics for Subroutines which are RecursiveHenry G. Baker. SIGPLAN, 27(12):39-46, 1992.

Computing A*B (mod N) efficiently in ANSI CHenry G. Baker. SIGPLAN, 27(1):95-98, 1992. [doi]

CONS should not CONS its arguments, or, a lazy alloc is a smart allocHenry G. Baker. SIGPLAN, 27(3):24-34, 1992. [doi]

Lively linear Lisp: look ma, no garbage! Henry G. Baker. SIGPLAN, 27(8):89-98, 1992. [doi]

The treadmill: real-time garbage collection without motion sicknessHenry G. Baker. SIGPLAN, 27(3):66-70, 1992. [doi]

Less complex elementary functionsHenry G. Baker. SIGPLAN, 27(11):15-16, 1992. [doi]

NREVERSAL of Fortune - The Thermodynamics of Garbage CollectionHenry G. Baker. iwmm 1992: 507-524

Critique of DIN Kernel Lisp Definition Version 1.2Henry G. Baker. lisp, 4(4):371-398, 1992.

A Decision Procedure for Common Lisp s SUBTYPEP PredicateHenry G. Baker. lisp, 5(3):157-190, 1992.

On the permutations of a vector obtainable through the restructure and transpose functions of APLHenry G. Baker. sigapl, 23(2):27-32, 1992. [doi]

1991

Shallow binding makes functional arrays fastHenry G. Baker. SIGPLAN, 26(8):145-147, 1991. [doi]

CLOStrophobia: its etiology and treatmentHenry G. Baker. oopsm, 2(4):4-15, 1991.

Precise instruction scheduling without a precise machine modelHenry G. Baker. sigarch, 19(6):4-8, 1991. [doi]

1990

Unify and ConquerHenry G. Baker. lfp 1990: 218-226 [doi]

1980

A source of redundant identifiers in PASCAL programsHenry G. Baker. SIGPLAN, 15(2):14-16, 1980. [doi]

1978

Shallow Binding in LISP 1.5Henry G. Baker. CACM, 21(7):565-569, 1978.

1977

Laws for Communicating Parallel ProcessesCarl Hewitt, Henry G. Baker. ifip11-9 1977: 987-992

Actors and Continuous FunctionalsCarl E. Hewitt, Henry G. Baker. ifip2 1978: 367-390

Sign in or sign up to see more results.

runs on WebDSL