default search action
Christopher T. Haynes
Person information
- affiliation: Indiana University, Bloomington, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
- [j9]Venkatesh Choppella, Christopher T. Haynes:
Source-tracking unification. Inf. Comput. 201(2): 121-159 (2005) - 2003
- [c10]Venkatesh Choppella, Christopher T. Haynes:
Source-Tracking Unification. CADE 2003: 458-472 - 2001
- [b2]Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes:
Essentials of programming languages (2. ed.). MIT Press 2001, ISBN 978-0-262-06217-6, pp. I-XVIII, 1-389
1990 – 1999
- 1998
- [j8]Harold Abelson, R. Kent Dybvig, Christopher T. Haynes, Guillermo Juan Rozas, N. I. Adams IV, Daniel P. Friedman, Eugene E. Kohlbecker, Guy L. Steele Jr., David H. Bartley, Robert H. Halstead Jr., Don Oxley, Gerald J. Sussman, G. Brooks, Chris Hanson, Kent M. Pitman
, Mitchell Wand:
Revised Report on the Algorithmic Language Scheme. High. Order Symb. Comput. 11(1): 7-105 (1998) - [c9]Christopher T. Haynes:
Experience with an analytic approach to teaching programming languages. SIGCSE 1998: 350-354 - 1997
- [c8]Christopher T. Haynes:
Compiling: a high-level introduction using Scheme. SIGCSE 1997: 253-257 - 1994
- [j7]Roy Rada, George S. Carson, Christopher T. Haynes:
The Role of Consensus. Commun. ACM 37(4): 15-16 (1994) - [j6]Roy Rada, Steve Carson, Christopher T. Haynes, James W. Moore:
IT standards development and consensus: three case studies. ACM Stand. 2(1): 50-54 (1994) - [c7]Hsianlin Dzeng, Christopher T. Haynes:
Type Reconstruction for Variable-Arity Procedures. LISP and Functional Programming 1994: 239-249 - 1992
- [b1]Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes:
Essentials of programming languages. MIT Press 1992, ISBN 978-0-262-06145-2, pp. 1-536
1980 – 1989
- 1988
- [j5]R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes:
Expansion-Passing Style: A General Macro Mechanism. LISP Symb. Comput. 1(1): 53-75 (1988) - 1987
- [j4]Christopher T. Haynes, Daniel P. Friedman:
Abstracting Timed Preemption with Engines. Comput. Lang. 12(2): 109-121 (1987) - [j3]Christopher T. Haynes:
Logic Continuations. J. Log. Program. 4(2): 157-176 (1987) - [j2]Christopher T. Haynes, Daniel P. Friedman:
Embedding Continuations in Procedural Objects. ACM Trans. Program. Lang. Syst. 9(4): 582-598 (1987) - 1986
- [j1]Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand:
Obtaining Coroutines with Continuations. Comput. Lang. 11(3/4): 143-153 (1986) - [c6]Christopher T. Haynes:
Logic Continuations. ICLP 1986: 671-685 - [c5]R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes:
Expansion-Passing Style: Beyond Conventional Macros. LISP and Functional Programming 1986: 143-150 - 1985
- [c4]Daniel P. Friedman, Christopher T. Haynes:
Constraining Control. POPL 1985: 245-254 - 1984
- [c3]Christopher T. Haynes, Daniel P. Friedman:
Engines Build Process Abstractions. LISP and Functional Programming 1984: 18-24 - [c2]Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand:
Continuations and Coroutines. LISP and Functional Programming 1984: 293-298 - [c1]Christopher T. Haynes:
A Theory of Data Type Representation Independence. Semantics of Data Types 1984: 157-175
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-24 22:46 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: