Laws@SRI-AI.ARPA@sri-unix.UUCP (08/09/83)
From: Ken Laws <Laws@SRI-AI.ARPA> [Includes programming environments and techniques as well as automatic programming.] Abdallah, M.A.N.* Data types as algorithms.* Waterloo U. Comp.Sci.Dept.*Res.Rpt. CS-82-10.*1982. Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent programming.* Arizona U. Comp.Sci.Dept.*TR 82-12.*1982. Andrews, G.R. Schneider, F.B.*Concepts and notations for concurrent programming.* Arizona U. Comp.Sci.Dept.*TR 82-12.*1982. Andrews, G.R.* Distributed programming languages.* Arizona U. Comp.Sci.Dept.*TR 82-13.*1982. Archer, J.E. Jr.*The design and implementation of a cooperative program development environment.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-468, Ph.D. Thesis. Archer, J.E. Jr.*1982. Bakker, J.W. de Zucker, J.I.* Processes and the denotational semantics of concurrency.* Mathematisch Centrum.*IW 209/82.*1982. Barber, G.*Supporting organizational problem solving with a workstation.* M.I.T. A.I. Lab.*Memo 681.*1982. Bergstra, J.A. Klop, J.W.* Fixed point semantics in process algebras.* Mathematisch Centrum.*IW 206/82.*1982. Bergstra, J.A. Tucker, J.V.* Hoare's logic for programming languages with two data types.* Mathematisch Centrum.*IW 207/82.*1982. Best, E.* Relational semantics of concurrent programs (with some applications).* Newcastle Upon Tyne U. Computing Lab.*No. 180.*1982. Bobrow, D.G. Stefik, M.*The LOOPS manual (preliminary version).* Xerox. Palo Alto Res. Center.*Memo KB-VLSI-81-13.*1981, (working paper). Bonar, J. Soloway, E.*Uncovering principles of novice programming.* Yale U. Comp.Sci.Dept.*Res.Rpt. 240.*1982. Burger, W.F. Halim, N. Pershing, J.A. Parr, F.N. Strom, R.E. Yemini, S.*Draft NIL reference manual.* IBM Watson Res. Center.*RC 9732.*1982. Culik, K. Rizki, M.M.* Mathematical constructive proofs as computer programs.* Wayne State U. Comp.Sci.Dept.* CSC-83-004.*1983. diSessa, A.A.*A principled design for an integrated computational environment.* M.I.T. Lab. for Comp.Sci.* TM-223.*1982. Ehrlich, K. Soloway, E.*An empirical investigation of the tacit plan knowledge in programming.* Yale U. Comp.Sci.Dept.*Res.Rpt. 236.*1982. Elrad, T. Francez, N.*A weakest precondition semantics for communicating processes.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 244.*1982. Ericson, L.W.* DPL-82: a language for distributed processing.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-129.*1982. Eyries, F.*Synthese d'images de scenes composees de spheres.* INRIA.*Rapport de Recherche 163.*1982. Good, D.I.*The proof of a distributed system in GYPSY.* Texas U. Computing Sci.Inst.*TR-030.*1982. Israel, B.*Customizing a personal computing environment through object oriented programming.* Maryland U. Comp.Sci. Center.*TR-1158.*1982. Jobmann, M.*ILMAOS - Eine Sprache zur Formulierung von Rechensystemmodellen.* Hamburg U. Fachbereich Informatik.* Bericht Nr. 91.*1982. Kanasaki, K. Yamaguchi, K. Kunii, T.L.*A software development system supported by a database of structures and operations.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-15.*1982. Kant, E. Newell, A.* Problem solving techniques for the design of algorithms.* Carnegie Mellon U. Comp.Sci.Dept.* CMU-CS-82-145.*1982. Krafft, D.B.* AVID: a system for the interactive development of verifiably correct programs.* Cornell U. Comp.Sci.Dept.*Tech.rpt. 81-467.*1981. Lacos, C.A. McDermott, T.S.*Interfacing with the user of a syntax directed editor.* Tasmania U. Info.Sci.Dept.*No. R82-03.*1982. Lamping, J. King, J.J.* IZZI--a translator from Interlisp to Zetalisp.* Hewlett Packard Co. Comp.Sci.Lab.* CSL-82-010; Hewlett Packard Co. Comp.Res. Center.* CRC-TR-82-005.*1982. LeBlanc, T.J.*The design and performance of high level language primitives for distributed programming.* Wisconsin U. Comp.Sci.Dept.*Tech.Rpt. 492, Ph.D. Thesis. LeBlanc, T.J.*1982. Lengauer, C.*A methodology for programming with concurrency.* Toronto U. Comp. Systems Res. Group.* CSRG-142, Ph.D. Thesis. Lengauer, C.*1982. Lesser, V. Corkill, D. Pavlin, J. Lefkowitz, L. Hudlicka, E. Brooks, R. Reed, S.*A high-level simulation testbed for cooperative distributed problem solving.* Massachusetts U. Comp. & Info.Sci.Dept.*COINS Tech.Rpt. 81-16.*1981. Lieberman, H.*Seeing what your programs are doing.* M.I.T. A.I. Lab.*Memo 656.*1982. Lochovsky, F.H.* Alpha beta, edited by F.H. Lochovsky.* Toronto U. Comp. Systems Res. Group.*CSRG-143.*1982. Contents: (1) Lochovsky, F.H. Tsichritzis, D.C.* Interactive query language for external data bases; (2) Mendelzon, A.O.*A database editor; (3) Lee, D.L.*A voice response system for an office information system; (4) Gibbs, S.J.* Office information models and the representation of 'office objects'; (5) Martin, P.* Tsichritzis, D.C.*A message management model; (6) Nierstrasz, O.*Tsichritzis, D.C.* Message flow modeling; (7) Tsichritzis, D.C. Christodoulakis, S. Faloutsos, C.* Design considerations for a message file server. Mahr, B. Makowsky, J.A.*Characterizing specification languages which admit initial semantics.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 232.*1982. McAllester, D.A.* Reasoning utility package. User's manual. Version one.* M.I.T. A.I. Lab.*Memo 667.*1982. Medina-Mora, R.* Syntax directed editing: towards integrated programming environments.* Carnegie Mellon U. Comp.Sci.Dept.* Ph.D. Thesis. Medina-Mora, R.*1982. Melese, B.* Metal, un langage de specification pour le systeme mentor.* INRIA.*Rapport de Recherche 142.*1982. Olsen, D.R. Jr. Badler, N.*An expression model for graphical command languages.* Arizona State U. Comp.Sci.Dept.*TR-82-001.*1982. Paige, R.* Transformational programming--applications to algorithms and systems: summary paper.* Rutgers U. Comp.Sci.Dept.*DCS-TR-118.*1982. Parr, F.N. Strom, R.E.* NIL: a high level language for distributed systems programming.* IBM Watson Res. Center.*RC 9750.*1982. Pratt, V.*Five paradigm shifts in programming language design and their realization in Viron, a dataflow programming environment.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-951.*1982. 9p. Rosenstein, L.S.* Display management in an integrated office workstation.* M.I.T. Lab for Comp.Sci.*TR-278.* 1982. Ross, P.M.* TERAK LOGO user's manual (for version 1 - 0).* Edinburgh U. A.I. Dept.*Occasional Paper 021.*1980. Schlichting, R.D. Schneider, F.B.*Using message passing for distributed programming: proof rules and disciplines.* Arizona U. Comp.Sci.Dept.*TR 82-05.*1982. Schmidt, E.E.*Controlling large software development in a distributed environment.* Xerox. Palo Alto Res. Center.*CSL-82-07, Ph.D. Thesis. Schmidt, E.E. (University of California at Berkeley).*1982. Senach, B.*Aide a la resolution de probleme par presentation graphique des informations.* INRIA.*Rapport de Recherche 013.*1982. Soloway, E. Bonar, J. Ehrlich, K.* Cognitive strategies and looping constructs: an empirical study.* Yale U. Comp.Sci.Dept.*Res.Rpt. 242.*1982. Soloway, E. Ehrlich, K. Bonar, J. Greenspan, J.*What do novices know about programming?* Yale U. Comp.Sci.Dept.* Res.Rpt. 218.*1982. Stefik, M. Bell, A.G. Bobrow, D.G.* Rule oriented programming in LOOPS.* Xerox. Palo Alto Res. Center.*Memo KB-VLSI-82-22.*1982. (working paper). Sterling, L. Bundy, A.* Meta level inference and program verification.* Edinburgh U. A.I. Dept.*Res. Paper 168.* 1982. Sterling, L. Bundy, A. Byrd, L. O'Keefe, R. Silver, B.* Solving symbolic equations with PRESS.* Edinburgh U. A.I. Dept.*Res. Paper 171.*1982. Tappel, S. Westfold, S. Barr, A.* Programming languages for AI research (Chapter VI of Volume II of the Handbook of Artificial Intelligence, edited by Avron Barr and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.* STAN-CS-82-935; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-017.*1982. 90p. Theriault, D.*A primer for the Act-1 language.* M.I.T. A.I. Lab.*Memo 672.*1982. Thompson, H.*Handling metarules in a parser for GPSG. Edinburgh U. A.I. Dept.*Res. Paper 175.*1982. Walker, A.* PROLOG/EX1: an inference engine which explains both yes and no answers.* IBM Watson Res. Center.*RJ 3771.*1983. Waters, R.C.* LetS: an expressional loop notation.* M.I.T. A.I. Lab.*Memo 680a.*1983. Wilensky, R.*Talking to UNIX in English: an overview of an on-line consultant.* California U., Berkeley. Comp.Sci.Div.*UCB/CSD 82/104.*1982. Wolper, P.L.*Synthesis of communicating processes from temporal logic specifications.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-925, Ph.D. Thesis. Wolper, P.L.* 1982. 111p. Wood, R.J.* Franz flavors: an implementation of abstract data types in an applicative language.* Maryland U. Comp.Sci. Center.*TR-1174.*1982. Woods, D.R.*Drawing planar graphs.* Stanford U. Comp.Sci.Dept.*STAN-CS-82-943, Ph.D. Thesis. Woods, D.R.* 1981.