Advanced Search
DSpace@MIT

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Research and Teaching Output of the MIT Community

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Sort by: Order: Results:

  • Yonezawa, Akinori (MIT Artificial Intelligence Laboratory, 1976-04)
    Symbolic-evaluation is the process which abstractly evaluates an actor program and checks to see whether the program fulfills its contract (specification). In this paper, a formalism based on the conceptual representation ...
  • Yonezawa, Akinori; Hewitt, Carl (1976-12-01)
    Symbolic evaluation is a process which abstractly evaluates an program on abstract data. A formalism based on conceptual representations is proposed as a specification language for programs with side-effects. Relations ...
  • Near, Joseph P.; Jackson, Daniel (2014-04-22)
    Symbolic execution of a language is traditionally achieved by replacing the language s interpreter with an entirely new interpreter. This may be an unnecessary burden, and it is tempting instead to try to use as much of ...
  • Moses, Joel (1966-06-01)
    A program has been written which is capable of integrating all but two of the problems solved by the Siagle's symbollic integration program SAINT. In contrast to SAINT, it is a purely algorithmic program and it has ...
  • Moses, Joel (1967-09-01)
    SIN and SOLDIER are heuristic programs in LISP which solve symbolic integration problems. SIN (Symbolic INtegrator) solves indefinite integration problems at the difficulty approaching those in the larger integral ...
  • Moses, Joel (1966-10-01)
    In this memo we describe the current state of the integration program originally described in AI Memo 97 (MAC-M-310). Familiarity with Memo 97 is assumed. Some of the algorithms described in that memo have been extended. ...
  • Martin, William A. (1967-01-01)
    A large computer program has been developed to aid applied mathematicians in the solution of problems in non-numerical analysis which involve tedious manipulations of mathematical expressions. The mathematician uses ...
  • McAllester, David Allen (1983-08-01)
    It is possible to represent a finite set of points (atoms) by a finite sequence of points. However a finite set of points has no distinguished member and therefore it is impossible to define a function which takes a ...
  • Poggio, T.; Koch, C. (1987-06-01)
    Biophysics of computation is a new field that attempts to characterize the role in information processing of the several biophysical mechanisms in neurons, synapses, and membranes that have been uncovered in recent ...
  • Waters, Richard C. (1987-11-01)
    The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to ...
  • Bawden, Alan; Rees, Jonathan (1988-06-01)
    In this paper we describe {\\it syntactic closures}. Syntactic closures address the scoping problems that arise when writing macros. We discuss some issues raised by introducing syntactic closures into the macro ...
  • Martin, William (1965-07-01)
    A LISP program converts a mathematical expression stored in list structure form, into a text-book style visual display. To do this, requires the selection and positioning of the individual symbols which make up the expression, ...
  • Forte, Allen (1967-04-01)
    As part of a larger research project in musical structure, a program has been written which "reads" scores encoded in an input language isomorphic to music notation. The program is believed to be the first of its kind. ...
  • Levin, Michael (1964-05-01)
    This is a definition of the syntax of the *** language. It consists of modifications and extensions of the "Revised Report on the Algorithmic Language ALGOL 60" which is printed in the "Communications of the ACM", January ...
  • Sussman, Gerald Jay (MIT Artificial Intelligence Laboratory, 1974-06)
    I have just completed teaching two sections of 6.011 (Elementary Network Theory). One of the topics covered was synthesis of active filters by the "method of unilateral 2-ports". The explanation of this technique by the ...
  • Nguyen; Van-Duc (1985-09-01)
    This paper addresses the problem of synthesizing planar grasps that have force closure. A grasp on an object is a force closure grasp if and only if we can exert, through the set of contacts, arbitrary force and moment on ...
  • Kornfeld, William A. (MIT Artificial Intelligence Laboratory, 1980-07)
    Two well known programming methodologies for artificial intelligence research are compared, the so-called pattern-directed invocation languages and the object-oriented languages. The features and limitations of both ...
  • Misailovic, Sasa; Rinard, Martin (2013-12-29)
    We present Syndy, a technique for automatically synthesizing randomized map/fold computations that trade accuracy for performance. Given a specification of a fully accurate computation, Syndy automatically synthesizes ...
  • Nguyen; Van-Duc (1986-07-01)
    This thesis addresses the problem of synthesizing grasps that are force-closure and stable. The synthesis of force-closure grasps constructs independent regions of contact for the fingertips, such that the motion of ...
  • Nguyen; Van-Duc (1985-10-01)
    This paper addresses the problem of synthesizing stable grasps on arbitrary planar polygons. Each finger is a virtual spring whose stiffnes and compression can be programmed. The contacts between the finger tips and the ...
MIT-Mirage