default search action
Henry G. Baker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
- [j35]Henry G. Baker:
You Could Learn a Lot from a Quadratic: I. Overloading Considered Harmful. ACM SIGPLAN Notices 33(1): 30-38 (1998) - [j34]Henry G. Baker:
You Could Learn a Lot from a Quadratic: II. Digital Dentistry. ACM SIGPLAN Notices 33(2): 34-39 (1998) - [j33]Henry G. Baker:
March Möbius Madness with a Polynomial PostScript, March 32, 1998. ACM SIGPLAN Notices 33(3): 24-35 (1998) - [j32]Henry G. Baker:
You Could Learn a Lot from a Quadratic: Newton Squares the Circle. ACM SIGPLAN Notices 33(6): 27-31 (1998) - 1997
- [j31]Henry G. Baker:
When Bad Programs Happen to Good People. ACM SIGPLAN Notices 32(3): 27-31 (1997) - [j30]Henry G. Baker:
I Have a Feeling We're Not in Emerald City Anymore. ACM SIGPLAN Notices 32(4): 22-26 (1997) - [j29]Henry G. Baker:
COMFY - A Comfortable Set of Control Primitives for Machine Language Programming. ACM SIGPLAN Notices 32(6): 23-27 (1997) - [j28]Henry G. Baker:
The COMFY 6502 Compiler. ACM SIGPLAN Notices 32(11): 25-30 (1997) - 1995
- [j27]Henry G. Baker:
'Use-Once' Variables and Linear Objects - Storage Management, Reflection and Multi-Threading. ACM SIGPLAN Notices 30(1): 45-52 (1995) - [j26]Henry G. Baker:
CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A. ACM SIGPLAN Notices 30(9): 17-20 (1995) - [e1]Henry G. Baker:
Memory Management, International Workshop IWMM 95, Kinross, UK, September 27-29, 1995, Proceedings. Lecture Notes in Computer Science 986, Springer 1995, ISBN 3-540-60368-9 [contents] - 1994
- [j25]Henry G. Baker:
Linear logic and permutation stacks - the Forth shall be first. SIGARCH Comput. Archit. News 22(1): 34-43 (1994) - [j24]Henry G. Baker:
A "Linear Logic" Quicksort. ACM SIGPLAN Notices 29(2): 13-18 (1994) - [j23]Henry G. Baker:
Thermodynamics and Garbage Collection. ACM SIGPLAN Notices 29(4): 58-63 (1994) - [j22]Henry G. Baker:
Minimum Reference Count Updating with Deferred and Anchored Pointers for Functional Data Structures. ACM SIGPLAN Notices 29(9): 38-43 (1994) - [j21]Henry G. Baker:
Corrigenda: intersection algorithms for lines and circles. ACM Trans. Graph. 13(3): 308-310 (1994) - 1993
- [j20]Henry G. Baker:
Sparse polynomials and linear logic. SIGSAM Bull. 27(4): 10-14 (1993) - [j19]Henry G. Baker:
Iterators: signs of weakness in object-oriented languages. OOPS Messenger 4(3): 18-25 (1993) - [j18]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) - [j17]Henry G. Baker:
'Infant Mortality' and Generational Garbage Collection. ACM SIGPLAN Notices 28(4): 55-57 (1993) - [j16]Henry G. Baker:
Complex Gaussian Integers for 'Gaussian Graphics'. ACM SIGPLAN Notices 28(11): 22-27 (1993) - 1992
- [j15]Henry G. Baker:
Critique of DIN Kernel Lisp Definition Version 1.2. LISP Symb. Comput. 4(4): 371-398 (1992) - [j14]Henry G. Baker:
A Decision Procedure for Common Lisp's SUBTYPEP Predicate. LISP Symb. Comput. 5(3): 157-190 (1992) - [j13]Henry G. Baker:
On the permutations of a vector obtainable through the restructure and transpose functions of APL. ACM SIGAPL APL Quote Quad 23(2): 27-32 (1992) - [j12]Henry G. Baker:
Computing A*B (mod N) efficiently in ANSI C. ACM SIGPLAN Notices 27(1): 95-98 (1992) - [j11]Henry G. Baker:
CONS should not CONS its arguments, or, a lazy alloc is a smart alloc. ACM SIGPLAN Notices 27(3): 24-34 (1992) - [j10]Henry G. Baker:
The treadmill: real-time garbage collection without motion sickness. ACM SIGPLAN Notices 27(3): 66-70 (1992) - [j9]Henry G. Baker:
Lively linear Lisp: "look ma, no garbage!". ACM SIGPLAN Notices 27(8): 89-98 (1992) - [j8]Henry G. Baker:
Less complex elementary functions. ACM SIGPLAN Notices 27(11): 15-16 (1992) - [j7]Henry G. Baker:
Inlining Semantics for Subroutines which are Recursive. ACM SIGPLAN Notices 27(12): 39-46 (1992) - [c6]Henry G. Baker:
NREVERSAL of Fortune - The Thermodynamics of Garbage Collection. IWMM 1992: 507-524 - 1991
- [j6]Henry G. Baker:
CLOStrophobia: its etiology and treatment. OOPS Messenger 2(4): 4-15 (1991) - [j5]Henry G. Baker:
Precise instruction scheduling without a precise machine model. SIGARCH Comput. Archit. News 19(6): 4-8 (1991) - [j4]Henry G. Baker:
Shallow binding makes functional arrays fast. ACM SIGPLAN Notices 26(8): 145-147 (1991) - 1990
- [c5]Henry G. Baker:
Unify and Conquer. LISP and Functional Programming 1990: 218-226
1980 – 1989
- 1980
- [j3]Henry G. Baker:
A source of redundant identifiers in PASCAL programs. ACM SIGPLAN Notices 15(2): 14-16 (1980) - [c4]Henry G. Baker Jr., Clinton Parker:
High level language programs run ten times faster in microstore. MICRO 1980: 171-177
1970 – 1979
- 1978
- [j2]Henry G. Baker Jr.:
List Processing in Real Time on a Serial Computer. Commun. ACM 21(4): 280-294 (1978) - [j1]Henry G. Baker:
Shallow Binding in LISP 1.5. Commun. ACM 21(7): 565-569 (1978) - 1977
- [c3]Carl Hewitt, Henry G. Baker:
Laws for Communicating Parallel Processes. IFIP Congress 1977: 987-992 - [c2]Carl E. Hewitt, Henry G. Baker:
Actors and Continuous Functionals. Formal Description of Programming Concepts 1977: 367-390 - [c1]Henry G. Baker, Carl Hewitt:
The incremental garbage collection of processes. Artificial Intelligence and Programming Languages 1977: 55-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: