bcp.bib
@PREAMBLE{{\newcommand{\SortNoop}[1]{}}}
@ARTICLE{BoehmJacopini,
AUTHOR = {C. Boehm and G. Jacopini},
TITLE = {Flow diagrams, {T}uring machines, and languages with only
two formation rules},
JOURNAL = {Communications of the {ACM}},
YEAR = 1966,
VOLUME = 9,
NUMBER = {5},
PAGES = {366--371},
SOURCE = {kim bruce}
}
@ARTICLE{Church:SimplyTyped,
AUTHOR = {Alonzo Church},
TITLE = {A Formulation of the Simple Theory of Types},
JOURNAL = {Journal of Symbolic Logic},
VOLUME = {5},
PAGES = {56--68},
YEAR = 1940
}
@BOOK{Church41:CalcOfLambdaConv,
AUTHOR = {Alonzo Church},
TITLE = {The Calculi of Lambda Conversion},
PUBLISHER = {Princeton University Press},
CHECKED = {Not checked},
YEAR = 1941
}
@BOOK{CurryFeys,
AUTHOR = {Haskell B. Curry and Robert Feys},
TITLE = {Combinatory Logic},
VOLUME = 1,
PUBLISHER = {North Holland},
YEAR = 1958,
CHECKED = {Not checked},
COMPLETE = {Incomplete},
NOTE = {Second edition, 1968}
}
@ARTICLE{knuth:goto,
TITLE = {Structured programming with 'go to' statments},
AUTHOR = {Donald E. Knuth},
JOURNAL = {Communications of the {A}{C}{M}},
VOLUME = {6},
NUMBER = {4},
PAGES = {261--301},
YEAR = 1974
}
@ARTICLE{Dahl&66,
AUTHOR = {O. J. Dahl and K. Nygaard},
TITLE = {{SIMULA}---{A}n {ALGOL}-based simulation language},
JOURNAL = {Communications of the ACM},
VOLUME = 9,
NUMBER = 9,
MONTH = SEP,
YEAR = 1966,
PAGES = {671--678},
SOURCE = {From Danforth&88}
}
@ARTICLE{Hoare78:CSP,
AUTHOR = {C. A. R. Hoare},
TITLE = {Communicating Sequential Processes},
JOURNAL = {Communications of the ACM},
VOLUME = {21},
NUMBER = {8},
PAGES = {666--677},
MONTH = AUG,
YEAR = {1978},
NOTE = {Reprinted in ``Distributed Computing: Concepts and
Implementations'' edited by McEntire, O'Reilly and Larson,
IEEE, 1984},
ANNOTE = {This paper is now expanded into an excellent book detailed
by Hoare and published by Prentice-Hall. This paper is
reproduced in Kuhn and Padua's (1981, IEEE) survey
``Tutorial on Parallel Processing.'' Reproduced in
``Distributed Computing: Concepts and Implementations''
edited by McEntire, O'Reilly and Larson, IEEE, 1984.
Somewhat dated.},
BIBSOURCE = {ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib}
}
@INCOLLECTION{KAHN87,
AUTHOR = {Gilles Kahn},
TITLE = {Natural Semantics},
BOOKTITLE = {Proceedings of the Symposium on Theoretical Aspects of
Computer Science (STACS)},
EDITOR = {Franz-Josef Brandenburg and
Guy Vidal-Naquet and
Martin Wirsing},
PUBLISHER = {Springer-Verlag},
YEAR = {1987},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {247},
PAGES = {22--39}
}
@INPROCEEDINGS{johnsson85lambda,
AUTHOR = {Thomas Johnsson},
TITLE = {Lambda lifting: transforming programs to recursive equations},
BOOKTITLE = {Functional programming languages and computer architecture. Proc. of a conference (Nancy, France, Sept. 1985)},
PUBLISHER = {Springer-Verlag Inc.},
ADDRESS = {New York, NY, USA},
PAGES = {190--203},
YEAR = {1985},
URL = {citeseer.ist.psu.edu/johnsson85lambda.html}
}
@ARTICLE{self,
TITLE = {Self: {T}he Power of Simplicity},
AUTHOR = {David Ungar and Randall B. Smith},
JOURNAL = {Lisp and Symbolic Computation},
VOLUME = {4},
NUMBER = {3},
PAGES = {187--205},
YEAR = 1991
}
@BOOK{partial,
AUTHOR = {Neil D. Jones and Carsten K. Gomard and Peter Sestoft},
TITLE = {Partial {E}valuation and {A}utomatic {P}rogram {G}eneration},
ADDRESS = {Hemel Hempstead, Hertfordshire, UK},
PUBLISHER = {Prentice {H}all {I}nternational},
YEAR = {1993}
}
@BOOK{Milner80,
AUTHOR = {Milner, Robin},
PUBLISHER = {Springer-Verlag},
TITLE = {A Calculus of Communicating Systems},
YEAR = {1980},
SERIES = {Lecture Notes in Computer Science},
VOLUME = 92,
SOURCE = {Sangiorgi}
}
@INPROCEEDINGS{REYNOLDS83,
AUTHOR = {Reynolds, John C.},
TITLE = {Types, Abstraction, and Parametric Polymorphism},
BOOKTITLE = {Information Processing 83, Paris, France},
EDITOR = {R. E. A. Mason},
FULLPUBLISHER = {Elsevier Science Publishers B. V. (North-Holland)},
FULLADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
YEAR = {1983},
PAGES = {513--523},
SOURCE = {reynolds bib, with corrections from physical copy},
CHECKED = {checked January 1988}
}
@INCOLLECTION{Scott72,
AUTHOR = {Dana Scott},
TITLE = {Continuous Lattices},
BOOKTITLE = {Toposes, Algebraic Geometry, and Logic},
EDITOR = {F. W. Lawvere},
PUBLISHER = {Springer-Verlag},
YEAR = 1972,
PAGES = {97--136},
CHECKED = {Yes},
SERIES = {Lecture Notes in Mathematics},
NUMBER = {274}
}
@TECHREPORT{strachey-wadsworth,
AUTHOR = {Christopher Strachey and Christopher P. Wadsworth},
TITLE = {Continuations: {A} Mathematical Semantics for
Handling Full Jumps},
TYPE = {Programming Research Group Technical
Monograph},
NUMBER = {PRG-11},
INSTITUTION = {Oxford Univ.\ Computing Lab.},
YEAR = 1974,
NOTE = {Reprinted in {\em Higher-Order and Symbolic
Computation}, vol. 13 (2000), pp. 135--152}
}
@TECHREPORT{scott-strachey,
AUTHOR = {Dana Scott and Christopher Strachey},
TITLE = {Toward a Mathematical Semantics for Computer
Languages},
TYPE = {Programming Research Group Technical
Monograph},
NUMBER = {PRG-6},
INSTITUTION = {Oxford Univ.\ Computing Lab.},
YEAR = 1971
}
@INPROCEEDINGS{strachey-semantics,
AUTHOR = {Christopher Strachey},
TITLE = {Towards a Formal Semantics},
BOOKTITLE = {Formal Language Description Languages for Computer
Programming},
PUBLISHER = {North Holland},
YEAR = 1966,
PAGES = {198--220}
}
@MISC{STRACHEY67,
AUTHOR = {Strachey, Christopher},
TITLE = {Fundamental Concepts in Programming Languages},
HOWPUBLISHED = {Lecture Notes, International Summer School in Computer
Programming, Copenhagen},
MONTH = AUG,
YEAR = {1967},
NOTE = {Reprinted in {\em Higher-Order and Symbolic Computation},
13(1/2), pp. 1--49, 2000}
}
@ARTICLE{IC::WrightF1994,
TITLE = {A Syntactic Approach to Type Soundness},
AUTHOR = {Andrew K. Wright and Matthias Felleisen},
PAGES = {38--94},
JOURNAL = {Information and Computation},
FULLMONTH = {15~} # NOV,
MONTH = NOV,
YEAR = {1994},
VOLUME = {115},
NUMBER = {1},
SOURCE = {IC bib},
REFERENCES = {\cite{TOPLAS::AbadiCPP1991} \cite{BOOK::Barendregt1984}
\cite{POPL::CrankF1991} \cite{BOOK::CurryF1958}
\cite{POPL::DamasM1982} \cite{THESIS::Damas1985}
\cite{TOPLAS::DonahueD1985} \cite{POPL::DubaHM1991}
\cite{POPL::Felleisen1988} \cite{SCP::Felleisen1991}
\cite{MISC::FelleisenF1986} \cite{TCS::FelleisenF1989}
\cite{TCS::FelleisenFKD1987} \cite{TR::FelleisenH1989}
\cite{TAMS::Hindley1969} \cite{BOOK::HindleyS1986}
\cite{POPL::LeroyW1991} \cite{POPL::MacQueenPS1984}
\cite{ICALP::MasonT1989} \cite{JCSS::Milner1978}
\cite{TCS::MilnerT1991} \cite{POPL::MitchellH1988}
\cite{TOPLAS::MitchellP1988} \cite{TCS::Plotkin1975}
\cite{TR::Plotkin1981} \cite{THESIS::Reppy1991}
\cite{ACMCP::Reynolds1972} \cite{ICALP::Reynolds1974}
\cite{SICOMP::Scott1976} \cite{JSYML::Seldin1977}
\cite{TR::TalpinJ1991} \cite{THESIS::Tofte1987}
\cite{IC::Tofte1990} \cite{ESOP::Wright1992}}
}
@INPROCEEDINGS{SmithBrian84,
AUTHOR = {Brian Cantwell Smith},
TITLE = {Reflection and Semantics in Lisp},
BOOKTITLE = {{ACM} {S}ymposium on {P}rinciples of {P}rogramming
{L}anguages ({POPL}), Salt Lake City, Utah},
FULLPUBLISHER = {ACM Press},
MONTH = JAN,
YEAR = {1984},
PAGES = {23-39}
}
@ARTICLE{Reynolds:HOSC98,
AUTHOR = {John C. Reynolds},
TITLE = {Definitional Interpreters for Higher-Order
Programming Languages},
JOURNAL = {Higher-Order and Symbolic Computation},
YEAR = 1998,
VOLUME = 11,
NUMBER = 4,
PAGES = {363-397},
NOTE = {Reprinted from the proceedings of the 25th {ACM}
National Conference (1972),
with a foreword}
}
@TECHREPORT{Wir73,
AUTHOR = {N. Wirth},
TITLE = {The programming language {Pascal} (Revised report)},
INSTITUTION = {Dept. Informatik, Inst. F\"ur Computersysteme, ETH
Z\"urich},
TYPE = {Technical report},
NUMBER = {5},
ADDRESS = {Z\"urich, Switzerland},
MONTH = {Jul},
YEAR = {1973}
}
@INPROCEEDINGS{Kah74,
AUTHOR = {G. Kahn},
TITLE = {The semantics of a simple language for parallel
programming},
BOOKTITLE = {Information processing},
EDITOR = {J. L. Rosenfeld},
PUBLISHER = {North Holland, Amsterdam},
ADDRESS = {Stockholm, Sweden},
MONTH = {Aug},
YEAR = {1974},
PAGES = {471-475}
}
@ARTICLE{Tur79,
AUTHOR = {D. A. Turner},
TITLE = {{A} new implementation technique for applicative
languages},
JOURNAL = {Software - Practice and Experience},
VOLUME = {9},
NUMBER = {1},
PAGES = {31-49},
MONTH = {Jan},
YEAR = {1979},
ANNOTE = {ISSN 0038-0644}
}
@ARTICLE{WIRTH66,
AUTHOR = {Wirth, Niklaus and Hoare, C. A. R.},
TITLE = {A Contribution to the Development of {ALGOL}},
JOURNAL = {Communications of the ACM},
MONTH = {June},
VOLUME = {9},
NUMBER = {6},
YEAR = {1966},
PAGES = {413--432},
CHECKED = {4 September 1990}
}
@TECHREPORT{SCOTT70B,
AUTHOR = {Scott, Dana S.},
TITLE = {Outline of a Mathematical Theory of Computation},
TYPE = {Technical Monograph},
NUMBER = {PRG--2},
INSTITUTION = {Oxford University Computing Laboratory},
DEPARTMENT = {Programming Research Group},
ADDRESS = {Oxford, England},
MONTH = {November},
YEAR = {1970},
COMMENTS = {supersedes SCOTT70A},
CHECKED = {24 August 1990}
}
@INPROCEEDINGS{FLOYD67,
AUTHOR = {Floyd, Robert W.},
TITLE = {Assigning Meanings to Programs},
BOOKTITLE = {Mathematical Aspects of Computer Science},
PLACE = {New York City},
DATES = {April 5--7, 1966},
EDITOR = {J. T. Schwartz},
SERIES = {Proceedings of Symposia in Applied Mathematics},
VOLUME = {19},
PUBLISHER = {American Mathematical Society},
ADDRESS = {Providence, Rhode Island},
YEAR = {1967},
PAGES = {19--32},
CHECKED = {13 September 1992}
}
@ARTICLE{HOARE71A,
AUTHOR = {Hoare, C. A. R.},
TITLE = {Proof of a Program: {FIND}},
JOURNAL = {Communications of the ACM},
MONTH = {January},
VOLUME = {14},
NUMBER = {1},
YEAR = {1971},
PAGES = {39--45},
REPRINT = {Reprinted in \authorcite{Gries} \crosscite[pages~101--115]{GRIES78}},
CHECKED = {13 September 1992},
UPDATED = {12 May 1997}
}
@ARTICLE{NAUR63,
AUTHOR = {Peter Naur and others},
TITLE = {Revised Report on the Algorithmic Language {ALGOL} 60},
JOURNAL = {Communications of the ACM},
MONTH = {January},
VOLUME = {6},
NUMBER = {1},
YEAR = {1963},
PAGES = {1--17},
REPRINT = {Reprinted as \authorcite{Naur} \crosscite{NAUR63C} and \authorcite{Naur} \crosscite{NAUR63D} and in \authorcite{O'Hearn and Tennent} \crosscite[vol.~1, pages~19--49]{OHEARN97}},
CHECKED = {4 September 1990},
UPDATED = {10 May 1997}
}
@TECHREPORT{GORDON77,
AUTHOR = {Gordon, Michael J. and Milner, Robin and Morris, F. Lockwood and Newey, Malcolm and Wadsworth, Christopher P.},
TITLE = {A Metalanguage For Interactive Proof in {LCF}},
TYPE = {Internal Report},
NUMBER = {CSR--16--77},
INSTITUTION = {University of Edinburgh},
DEPARTMENT = {Department of Computer Science},
ADDRESS = {Edinburgh, Scotland},
MONTH = {September},
YEAR = {1977},
CHECKED = {19 November 1995}
}
@INPROCEEDINGS{filinski99representing,
AUTHOR = {Andrzej Filinski},
TITLE = {Representing Layered Monads},
BOOKTITLE = {{ACM} {S}ymposium on {P}rinciples of {P}rogramming
{L}anguages ({POPL}), San Antonio, Texas},
ADDRESS = {New York, NY},
PAGES = {175--188},
YEAR = {1999},
URL = {citeseer.ist.psu.edu/filinski99representing.html}
}
@ARTICLE{felleisen90expressivejournal,
AUTHOR = {Matthias Felleisen},
TITLE = {On the Expressive Power of Programming Languages},
JOURNAL = {Science of Computer Programming},
VOLUME = {17},
NUMBER = {1--3},
PUBLISHER = {Elsevier Science},
ADDRESS = {Amsterdam, Netherlands},
PAGES = {35-75},
MONTH = DEC,
YEAR = {1991},
URL = {www.sciencedirect.com/science/article/{B}6{V}17-45{GMGK}8-{X}/2/d9b687271373cf1bbdb69d30bb1d8eb2},
DOI = {doi:10.1016/0167-6423(91)90036-{W}}
}