Basic Research in Computer Science

Abstract : This report documents a broad program of basic and applied information processing research conducted by Carnegie Mellon's School of Computer Science. The Information Processing Technology Office of the Advanced Projects Agency (ARPA) supported this work during the period 1 August 1990 through 2 August 1993. Chapters 1 through 6 present in detail the six major research areas: Image Understanding, VLSI, Object Management, Integrated Architectures for Intelligent Systems, Creating Graphical Applications, and Types in Programming. Each chapter briefly describes the significant results of one research area and provides references for more detailed descriptions in the published literature. Image understanding, Very large scale integration, Object management, Integrated architectures for intelligent systems, Creating graphical applications, Types in programming.

[1]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[2]  Gerald Jay Sussman,et al.  The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two) , 1978 .

[3]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[4]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[5]  Nick Benton,et al.  A Term Calculus for Intuitionistic Linear Logic , 1993, TLCA.

[6]  Olivier Danvy,et al.  Continuation-based partial evaluation , 1994, LFP '94.

[7]  Jr. Guy L. Steele,et al.  Rabbit: A Compiler for Scheme , 1978 .

[8]  Peter Zilahy Ingerman,et al.  Thunks: a way of compiling procedure statements with some comments on procedure declarations , 1961, CACM.

[9]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[10]  David A. Schmidt,et al.  Denotationaisemantics: a methodology for language development , 1986 .

[11]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[12]  Mikael Rittri.  Retrieving Library Functions by Unifying Types Modulo Linear Isomorphism , 1993, RAIRO Theor. Informatics Appl..

[13]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[14]  Frank Pfenning,et al.  Higher-order abstract syntax , 1988, PLDI '88.

[15]  Olivier Danvy,et al.  Representing Control: a Study of the CPS Transformation , 1992, Mathematical Structures in Computer Science.

[16]  Don E. Ross,et al.  Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams , 1991, 28th ACM/IEEE Design Automation Conference.

[17]  Olivier Danvy,et al.  Lambda-dropping: transforming recursive equations into programs with block structure , 1997, Theor. Comput. Sci..

[18]  Lockwood Morris.  The next 700 formal language descriptions , 1993, LISP Symb. Comput..

[19]  Christian Queinnec.  Langage d'un autre type : LISP , 1983 .

[20]  P. J. Landin,et al.  The next 700 programming languages , 1966, CACM.

[21]  Nils Klarlund,et al.  Graph types , 1993, POPL '93.

[22]  Simon L. Peyton Jones,et al.  Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine , 1992, Journal of Functional Programming.

[23]  William H. Burge,et al.  Recursive Programming Techniques , 1975 .

[24]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[25]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..

[26]  Mitchell Wand,et al.  Deriving Target Code as a Representation of Continuation Semantics , 1982, TOPL.

[27]  Olivier Danvy,et al.  Back to Direct Style , 1992, Sci. Comput. Program..

[28]  Olivier Danvy,et al.  Back to direct style II: first-class continuations , 1992, LFP '92.

[29]  Andrzej Filinski,et al.  Representing monads , 1994, POPL '94.

[30]  John C. Reynolds,et al.  Definitional Interpreters for Higher-Order Programming Languages , 1972, ACM '72.

[31]  Olivier Danvy,et al.  A generic account of continuation-passing styles , 1994, POPL '94.

[32]  Sergei Soloviev.  A Complete Axiom System for Isomorphism of Types in Closed Categories , 1993, LPAR.

[33]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[34]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[35]  Gordon D. Plotkin,et al.  Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[36]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[37]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

[38]  Matthias Felleisen.  Reflections on Landins's J-Operator: A Partly Historical Note , 1987, Comput. Lang..

[39]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[40]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[41]  John C. Reynolds,et al.  The discoveries of continuations , 1993, LISP Symb. Comput..