• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,729
Next 10 →

MULTILISP: a language for concurrent symbolic computation

by Robert H. Halstead - ACM Transactions on Programming Languages and Systems , 1985
"... Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing par ..."
Abstract - Cited by 529 (1 self) - Add to MetaCart
Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing

• LISP

by Russell W. Morris, Technical Fellow , 1985
"... • 2005-Present Unprotected personal data – examples include; ..."
Abstract - Add to MetaCart
• 2005-Present Unprotected personal data – examples include;

Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I

by John Mccarthy , 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N00014-94-1-0775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract - Cited by 457 (3 self) - Add to MetaCart
and the practical role of an interpreter. Then we describe the representation of S-expressions in the memory of the IBM 704 by list structures similar to those used by Newell, Shaw and Simon [2], and the representation of S-functions by program. Then we mention the main features of the LISP programming system

Simplification by cooperating decision procedures

by Greg Nelson, Derek C. Oppen - ACM Transactions on Programming Languages and Systems , 1979
"... A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectiv ..."
Abstract - Cited by 455 (2 self) - Add to MetaCart
connectives, the equality predicate =, the conditional function if-then-else, the integers, the arithmetic functions and predicates +,-, and _<, the Lisp functions and predicates car, cdr, cons, and atom, the functions store and select for storing into and selecting from arrays, and uninterpreted function

Flow analysis and optimization of LISP-like structures

by Neil D. Jones, Steven S. Iluchnick - In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages , 1979
"... In [12] the authors introduced ..."
Abstract - Cited by 214 (1 self) - Add to MetaCart
In [12] the authors introduced

Domain-Specific Languages: An Annotated Bibliography

by Arie Van Deursen, Paul Klint, Joost Visser - ACM SIGPLAN NOTICES , 2000
"... We survey the literature available on the topic of domain-specific languages as used for the construction and maintenance of software systems. We list a selection of 75 key publications in the area, and provide a summary for each of the papers. Moreover, we discuss terminology, risks and benefits, e ..."
Abstract - Cited by 372 (11 self) - Add to MetaCart
. Of course, this is not a new topic. The older programming languages (Cobol, Fortran, Lisp)...

Control-Flow Analysis of Higher-Order Languages

by Olin Shivers , 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: data-flow analysis, Scheme, LISP, ML, CPS, type recovery, higher-order functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract - Cited by 365 (10 self) - Add to MetaCart
representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: data-flow analysis, Scheme, LISP, ML, CPS, type recovery, higher-order functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful

The Evolution of Lisp

by Guy L. Steele, Jr., Richard P. Gabriel - ACM SIGPLAN Notices , 1993
"... Lisp is the world's greatest programming language---or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one- ..."
Abstract - Cited by 56 (1 self) - Add to MetaCart
Lisp is the world's greatest programming language---or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one

Definitional interpreters for higher-order programming languages

by John C. Reynolds - Reprinted from the proceedings of the 25th ACM National Conference , 1972
"... Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include ..."
Abstract - Cited by 338 (2 self) - Add to MetaCart
Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include

Quasiquotation in Lisp

by Alan Bawden
"... Quasiquotation is the technology commonly used in Lisp to write program-generating programs. In this paper I will review the history and development of this technology, and explain why it works so well in practice. ..."
Abstract - Cited by 51 (0 self) - Add to MetaCart
Quasiquotation is the technology commonly used in Lisp to write program-generating programs. In this paper I will review the history and development of this technology, and explain why it works so well in practice.
Next 10 →
Results 1 - 10 of 1,729
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University