diff options
Diffstat (limited to 'info/biblio/litprog.bib')
-rw-r--r-- | info/biblio/litprog.bib | 333 |
1 files changed, 311 insertions, 22 deletions
diff --git a/info/biblio/litprog.bib b/info/biblio/litprog.bib index 221cf1f06e..b85f121664 100644 --- a/info/biblio/litprog.bib +++ b/info/biblio/litprog.bib @@ -4,9 +4,9 @@ %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", -%%% version = "3.33", -%%% date = "16 March 2019", -%%% time = "07:53:58 MDT", +%%% version = "3.35", +%%% date = "18 February 2020", +%%% time = "09:00:33 MST", %%% filename = "litprog.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB @@ -16,7 +16,7 @@ %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "http://www.math.utah.edu/~beebe", -%%% checksum = "40443 8415 37644 371397", +%%% checksum = "54971 8704 39206 386063", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", @@ -28,7 +28,7 @@ %%% fields will be printed if the is-alpha.bst %%% or is-plain.bst style files are used. %%% -%%% At version 3.33, the coverage looked like +%%% At version 3.35, the coverage looked like %%% this: %%% %%% 1982 ( 1) 1994 ( 19) 2006 ( 5) @@ -38,7 +38,7 @@ %%% 1986 ( 11) 1998 ( 14) 2010 ( 4) %%% 1987 ( 10) 1999 ( 6) 2011 ( 1) %%% 1988 ( 11) 2000 ( 5) 2012 ( 2) -%%% 1989 ( 15) 2001 ( 3) 2013 ( 0) +%%% 1989 ( 15) 2001 ( 3) 2013 ( 1) %%% 1990 ( 25) 2002 ( 10) 2014 ( 0) %%% 1991 ( 15) 2003 ( 10) 2015 ( 1) %%% 1992 ( 24) 2004 ( 5) 2016 ( 0) @@ -50,13 +50,13 @@ %%% InCollection: 1 %%% InProceedings: 49 %%% MastersThesis: 5 -%%% Misc: 20 +%%% Misc: 21 %%% PhdThesis: 7 %%% Proceedings: 20 %%% TechReport: 29 %%% Unpublished: 1 %%% -%%% Total entries: 305 +%%% Total entries: 306 %%% %%% There is an extensive ``Literate Programming %%% Library'' resource on the World Wide Web at @@ -593,8 +593,8 @@ @Article{Bentley:1986:PPLa, author = "Jon Bentley and {with Special Guest Oyster, Donald} E. Knuth", - title = "Programming Pearls: Literate Programming: a {\tt WEB} - program for sampling", + title = "Programming Pearls: Literate Programming: a {{\tt + WEB}} program for sampling", journal = j-CACM, volume = "29", number = "5", @@ -1791,6 +1791,22 @@ bibsource = "http://www.math.utah.edu/pub/tex/bib/litprog.bib", note = "See \cite{Baecker:1997:SVD}.", acknowledgement = ack-nhfb, + subject = "Visual programming (Computer science); Computer + graphics; Human-computer interaction; Computer + graphics.; Human-computer interaction.; Visual + programming (Computer science); Programmation + visuelle.; Infographie.; Interaction homme-ordinateur.; + Infographie; Interaction homme-machine (Informatique); + Programmation visuelle", + tableofcontents = "Visualizing Programs \\ + Background and Motivation \\ + Mapping C \\ + Source Text to Effective Visual Presentations \\ + A Graphic Design \\ + Manual for the C Programming Language \\ + Programs as Publications \\ + Future Issues in Program Presentation \\ + Appendices", } @InProceedings{Brown:1990:HLP, @@ -2201,8 +2217,8 @@ author = "T. L. Pappas", booktitle = "Proceedings of the Eighth Annual Conference on {Ada} Technology", - title = "Literate Programming for Reusability: a Queue - Package Example", + title = "Literate Programming for Reusability: a Queue Package + Example", publisher = "ANCOST, Inc.", address = "Atlanta, Georgia, USA", bookpages = "xiv + 669", @@ -2801,8 +2817,8 @@ booktitle = "{CompEuro} 1992 Proceedings: Computer Systems and Software Engineering, May 4--8, 1992, The Hague, The Netherlands", - title = "{VAMP}: a tool for literate programming independent - of programming language and formatter", + title = "{VAMP}: a tool for literate programming independent of + programming language and formatter", publisher = pub-IEEE-CSP, address = pub-IEEE-CSP:adr, bookpages = "xviii + 717", @@ -3382,8 +3398,8 @@ editor = "P. Dewilde and J. VandeWalle", booktitle = "CompEuro 1992 Proceedings. Computer Systems and Software engineering", - title = "{VAMP}: a tool for literate programming independent - of programming language and formatter", + title = "{VAMP}: a tool for literate programming independent of + programming language and formatter", publisher = "????", address = "????", pages = "371--376", @@ -3585,8 +3601,8 @@ @Book{Knuth:1993:SGPb, author = "Donald E. Knuth", - title = "The {Stanford} {GraphBase}: a Platform for - Combinatorial Computing", + title = "The {Stanford GraphBase}: a Platform for Combinatorial + Computing", publisher = pub-ACM, address = pub-ACM:adr, pages = "vii + 576", @@ -3608,6 +3624,14 @@ structures.", price = "US\$45.25", acknowledgement = ack-pb, + tableofcontents = "Technicalities \\ + Installation and use \\ + How to read CWEB programs \\ + Programs of the Stanford GraphBase \\ + Appendix A. Error codes \\ + Appendix B. Summary of function calls \\ + Appendix C. Example graph parameters \\ + Appendix D. 3000 five-letter words", } @Article{Levy:1993:LPC, @@ -5038,6 +5062,20 @@ programs.", URL = "http://www.cwi.nl/~gipe/language_prototyping/index.html", acknowledgement = ack-nhfb, + tableofcontents = "1. An overview of ASF+SDF / Arie van Deursen \\ + 2. The static semantics of pascal / Arie van Deursen + \\ + 3. A kernel object-oriented language / T. B. Dinesh \\ + 4. Typechecking with modular error handling / T.B. + Dinesh \\ + 5. Multi-level specifications / Eelco Visser \\ + 6. Incremental typechecking / Emma van der Meulen \\ + 7. Origin tracking and its applications / Arie van + Deursen, Paul Klint, and Frank Tip \\ + 8. Second-order term rewriting specification of static + semantics: An exercise / Jan Heering \\ + 9. Origin tracking for higher-order term rewriting + systems / Arie van Deursen and T.B. Dinesh", } @InProceedings{Hurst:1996:LPA, @@ -5110,6 +5148,8 @@ acknowledgement = ack-nhfb, remark = "This book exists because the Unix kernel was not written as a literate program, but needed to be.", + tableofcontents = "UNIX operating system source code level six \\ + A commentary on the UNIX operating system", } @InProceedings{Moore:1996:IAL, @@ -5401,11 +5441,34 @@ ISBN-13 = "978-0-201-49841-7", LCCN = "QA76.73.C15H37 1997", bibdate = "Fri Feb 27 16:08:11 1998", - bibsource = "http://www.math.utah.edu/pub/tex/bib/litprog.bib", + bibsource = "http://www.math.utah.edu/pub/tex/bib/fparith.bib; + http://www.math.utah.edu/pub/tex/bib/litprog.bib", price = "US\$37.95", series = "Addison-Wesley Professional Computing Series", URL = "http://www.cs.princeton.edu/software/cii/", acknowledgement = ack-nhfb, + subject = "C (Computer program language); Computer software; + Reusability; Literate Programming", + tableofcontents = "1. Introduction \\ + 2. Interfaces and Implementations \\ + 3. Atoms \\ + 4. Exceptions and Assertions \\ + 5. Memory Management \\ + 6. More Memory Management \\ + 7. Lists \\ + 8. Tables \\ + 9. Sets \\ + 10. Dynamic Arrays \\ + 11. Sequences \\ + 12. Rings \\ + 13. Bit Vectors \\ + 14. Formatting \\ + 15. Low-Level Strings \\ + 16. High-Level Strings \\ + 17. Extended-Precision Arithmetic \\ + 18. Arbitrary-Precision Arithmetic \\ + 19. Multiple-Precision Arithmetic \\ + 20. Threads", } @Article{Hendseth:1997:LPC, @@ -5939,6 +6002,21 @@ acknowledgement = ack-nhfb, subject = "C++ (Computer program language); LEDA (Computer file); literate programming; Lweb; noweb", + tableofcontents = "Introduction \\ + 1. Foundations \\ + 2. Basic Data Types \\ + 3. Numbers and Matrices \\ + 4. Advanced Data Types \\ + 5. Graphs and their Data Structures \\ + 6. Graph Algorithms \\ + 7. Embedded Graphs \\ + 8. The Geometry Kernels \\ + 9. Geometry Algorithms \\ + 10. Windows and Panels \\ + 11. GraphWin \\ + 12. On the Implementation of LEDA \\ + 13. Manual Pages and Documentation \\ + 14. Bibliography", } @Article{Normark:1999:PWW, @@ -6074,6 +6152,44 @@ MathSciNet database", series = "CSLI Lecture Notes", acknowledgement = ack-nhfb, + tableofcontents = "Mathematical analysis of algorithms \\ + The dangers of computer science theory \\ + The analysis of algorithms \\ + Big Omicron and big Omega and big Theta \\ + Optimal measurement points for program frequency counts + \\ + Estimating the efficiency of backtrack programs \\ + Ordered hase tables \\ + Activity in an interleaved memory \\ + An analysis of Alpha-Beta pruning \\ + Notes on generalized Dedekind sums \\ + The distribution of continued fraction approximations + \\ + Evaluation of Porter's constant \\ + The subtractive algorithm for greatest common divisors + \\ + Length of strings for a merge sort \\ + The average height of planted plane trees \\ + The toilet paper problem \\ + An analysis of optimum caching \\ + A trivial algorithm whose analysis isn't \\ + Deletions that preserve randomness \\ + Analysis of a simple factorization algorithm \\ + The expected linearity of a simple equivalence + algorithm \\ + Textbook examples of recursion \\ + An exact analysis of stable allocation \\ + Stable husbands \\ + Shellsort with three increments \\ + The average time for carry propagation \\ + Linear probing and graphs \\ + A terminological proposal \\ + Postscript about NP-hard problems \\ + An experiment in optimal sorting \\ + Duality in addition chains \\ + Complexity results for bandwidth minimization \\ + The problem of compatible representatives \\ + The complexity of nonuniform random number generation", } @InProceedings{Normark:2000:REP, @@ -6551,6 +6667,28 @@ early history and development of fundamental concepts that have now become thoroughly integrated into modern software systems.''", + tableofcontents = "1: The Early Development of Programming Languages + \\ + 2: Backus Normal Form versus Backus Naur Form \\ + 3: Teaching ALGOL 60 \\ + 4: ALGOL 60 Confidential \\ + 5: Smalgol-61 \\ + 6: Man or Boy? \\ + 7: A Proposal for Input-Output Conventions in ALGOL 60 + \\ + 8: The Remaining Trouble Spots in ALGOL 60 \\ + 9: SOL \\ + A Symbolic Language for Systems Simulation \\ + 10: A Formal Definition of SOL \\ + 11: The Science of Programming Languages \\ + 12: Programming Languages for Automata \\ + 13: A Characterization of Parenthesis Languages \\ + 14: Top-Down Syntax Analysis \\ + 15: On the Translation of Languages from Left to Right + \\ + 16: Context-Free Multilanguages \\ + 17: Semantics of Context-Free Languages \\ + 18: Examples of Formal Semantics", } @Book{Knuth:2003:SPD, @@ -6627,6 +6765,39 @@ about what has happened after the paper was published: further investigations and new results related to the topic of the paper, comments, corrections.", + tableofcontents = "1. Discussion of Mr. Riordan's paper `Abel + identities and inverse relations' \\ + 2. Duality in addition chains \\ + 3. Combinatorial analysis and computers \\ + 4. Tables of finite fields \\ + 5. Finite semifields and projective planes \\ + 6. A class of projective planes \\ + 7. Construction of a random sequence \\ + 8. Oriented subtrees of an arc digraph \\ + 9. Another enumeration of trees \\ + 10. Notes on central groupoids \\ + 11. Permutations, matrices, and generalized Young + tableaux \\ + 12. A note on solid partitions \\ + 13. Subspaces, subsets, and partitions \\ + 14. Enumeration of plane partitions \\ + 15. Complements and transitive closures \\ + 16. Permutations with nonnegative partial sums \\ + 17. Wheels within wheels \\ + 18. The asymptotic number of geometries \\ + 19. Random matroids \\ + 20. Identities from partition involutions \\ + 21. Huffman's algorithm via algebra \\ + 22. A permanent inequality \\ + 23. Efficient balanced codes \\ + 24. The power of a prime that divides a generalized + binomial coefficient \\ + 25. The first cycles in an evolving graph \\ + 26. The birth of the giant component \\ + 27. Polynomials involving the floor function \\ + 28. The sandwich theorem \\ + 29. Aztec diamonds, checkerboard graphs, and spanning + trees", } @Article{Leisch:2003:PPI, @@ -7042,6 +7213,25 @@ subject = "MP3 (Audio coding standard); Music; Data processing; Computer sound processing; Computer network resources; Computer programs", + tableofcontents = "1. Introduction \\ + 2. Digital filters and subband synthesis \\ + 3. Standard synthesis subband filter \\ + 4. Subbands, the key to audio compression \\ + 5. How to use mp32pcm \\ + 6. How mp32pcm works \\ + 7. Unpacking the frame \\ + 8. Reading the bit stream \\ + 9. Improving the bit packing: layer II \\ + 10. The mathematics of analyzing components \\ + 11. New ideas: layer III \\ + 12. Huffman coding \\ + 13. Advanced bit packing: layer III \\ + 14. Low sample frequencies \\ + Appendices \\ + A. Tables and special code \\ + B. Theory and practice of CRCs \\ + C. Equalization \\ + D. Testing compliance", } @InProceedings{Vestdam:2005:TDP, @@ -7269,6 +7459,48 @@ subject = "Computer programming; Programming languages (Electronic computers); Computer software; Development", + tableofcontents = "1. On the defensive: defensive programming + techniques for robust code \\ + 2. The best laid plans: the layout and presentation of + source code \\ + 3. What's in a name?: giving meaningful things + meaningful names \\ + 4. The write stuff: techniques for writing + ``self-documenting'' code \\ + 5. A passing comment: how to write code comments \\ + 6. To err in human: dealing with the inevitable \\ + error conditions in code \\ + 7. The programmer's toolbox: using tools to construct + software \\ + 8. Testing times: the black art of testing code \\ + 9. Finding fault: debugging: what to do when things go + wrong \\ + 10. The code that Jack built: mechanisms to turn source + code into executable code \\ + 11. The need for speed: optimizing programs and writing + efficient code \\ + 12. An insecurity complex: writing secure programs \\ + 13. Grand designs: how to produce good software designs + \\ + 14. Software architecture: laying the foundations of + software design \\ + 15. Software evolution or software revolution?: how + does code grow? \\ + 16. Code monkeys: fostering the correct attitude and + approach to programming \\ + 17. Together we stand: teamwork and the individual + programmer \\ + 18. Practicing safe source: source control and + self-control \\ + 19. Being specific: writing software specifications \\ + 20. A review to a kill: performing code reviews \\ + 21. How long is a piece of string?: the black art of + software timescale estimation \\ + 22. Recipe for a program: code development + methodologies and processes \\ + 23. The outer limits: the different programming + disciplines \\ + 24. Where next?: all's well that ends well", } @Article{Lenth:2007:SLP, @@ -7472,9 +7704,25 @@ LCCN = "HD8039.D37 S45 2009", bibdate = "Mon Jul 5 13:24:12 MDT 2010", bibsource = "http://www.math.utah.edu/pub/tex/bib/litprog.bib; + http://www.math.utah.edu/pub/tex/bib/unix.bib; z3950.bibsys.no:2100/BIBSYS", acknowledgement = ack-nhfb, keywords = "literate programming", + tableofcontents = "Jamie Zawinski \\ + Brad Fitzpatrick \\ + Douglas Crockford \\ + Brendan Eich \\ + Joshua Bloch \\ + Joe Armstrong \\ + Simon Peyton Jones \\ + Peter Norvig \\ + Guy Steele \\ + Dan Ingalls \\ + L. Peter Deutsch \\ + Ken Thompson \\ + Fran Allen \\ + Bernie Cosell \\ + Donald Knuth", } @Book{Anonymous:2010:FTS, @@ -7613,6 +7861,24 @@ pubdates = "Submitted 2010-12-22; Accepted 2011-10-03", } +@Misc{Robbins:2013:TJ, + author = "Arnold Robbins", + title = "{TexiWeb Jr.}", + howpublished = "Github project.", + month = nov, + year = "2013", + bibdate = "Tue Feb 18 07:48:15 2020", + bibsource = "http://www.math.utah.edu/pub/tex/bib/litprog.bib", + URL = "https://github.com/arnoldrobbins/texiwebjr", + abstract = "This is TexiWeb Jr., a super simple literate + programming system built on top of Texinfo and + implemented in awk. The ``tangle'' piece was + successfully bootstrapped on November 4, 2013. The + ``weave'' piece started producing a reasonable-looking + document on November 11, 2013.", + acknowledgement = ack-nhfb, +} + @Book{Ruckert:2015:MSS, author = "Martin Ruckert", title = "The {MMIX} supplement: supplement to {{\booktitle{The @@ -7946,9 +8212,9 @@ @Book{Broy:1991:MPS, author = "Manfred Broy and Martin Wirsing", - booktitle = "Methods of programming. Selected papers on the + booktitle = "Methods of programming. {Selected} papers on the {CIP-Project}", - title = "Methods of programming. Selected papers on the + title = "Methods of programming. {Selected} papers on the {CIP-Project}", volume = "544", publisher = pub-SV, @@ -7982,6 +8248,29 @@ elimination; Reverse Polish notation; Software reusability; System development; Transformational programming", + tableofcontents = "Two metamodels for application system development: + conventional vs. object-oriented approach / W. Hesse + \\ + Transformational meta program development / B. + Krieg-Br{\"u}ckner \\ + Another case study on reusability of transformational + developments pattern matching according to Knuth, + Morris, and Pratt / H.A. Partsch, N. V{\"o}lker \\ + A formal method for the systematic reuse of + specification components / R. Hennicker, M. Wirsing \\ + Deductive program development: evaluation in reverse + Polish notation as an example / M. Broy \\ + Literate program derivation: a case study / P. Pepper + \\ + Programs viewed as SKOLEM functions / R. + Steinbr{\"u}ggen \\ + Calculating a garbage collector / U. Berger, W. + Meixner, B. M{\"o}ller \\ + On the use of elements of functional programming in + program development by transformations / R. Berghammer, + H. Ehler \\ + Transformational development of circuit descriptions + for binary adders / C. Delgado Kloos, W. Dosch", thesaurus = "Formal logic; Formal specification; Programming; Programming theory; Software reusability", } @@ -8409,7 +8698,7 @@ URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3092", acknowledgement = ack-nhfb, keywords = "literate programming", - meetingname = "XP 2004 (2004 : Garmisch-Partenkirchen, Germany)", + meetingname = "XP 2004 (2004: Garmisch-Partenkirchen, Germany)", subject = "Computer software; Development; Congresses; eXtreme programming", } |