• Publications
  • Influence
Constraint logic programming languages
TLDR
Constraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the pattern matching mechanism of unification, as used in Prolog, by a more general operation called constraint satisfaction. Expand
  • 278
  • 16
Garbage Collection of Linked Data Structures
  • J. Cohen
  • Computer Science
  • CSUR
  • 1 September 1981
TLDR
A concise and unified view of the numerous existing algorithms for performing garbage collection of linked data structures is presented. Expand
  • 259
  • 12
  • PDF
Bioinformatics—an introduction for computer scientists
TLDR
The article aims to introduce computer scientists to the new field of bioinformatics. Expand
  • 223
  • 8
  • PDF
Uniform Random Generation of Strings in a Context-Free Language
TLDR
A method for generating uniform random strings in an unambiguous context-free language using a precomputed table. Expand
  • 71
  • 5
Two languages for estimating program efficiency
TLDR
Two languages enabling their users to estimate the efficiency of computer programs are presented. Expand
  • 43
  • 4
Two Algorithms for Determining Volumes of Convex Polyhedra
Determining volumes of convex n-dimensional polyhedra defined by a linear system of inequalities is useful in program analysis Two methods for computing these volumes are proposed (1) summing theExpand
  • 99
  • 3
Parsing and compiling using Prolog
TLDR
This paper presents the material needed for exposing the reader to the advantages of using Prolog as a language for describing succinctly most of the algorithms needed in prototyping and implementing compilers or producing tools that facilitate this task. Expand
  • 68
  • 3
  • PDF
Concurrent object-oriented programming
  • J. Cohen
  • Computer Science
  • CACM
  • 1 September 1993
  • 166
  • 2
Non-Deterministic Algorithms
TLDR
Prnmtive commands representing the concepts of choice, failure, and success are used to describe non-deterministic algorithms for solving a variety of problems. Expand
  • 52
  • 2
An Algorithm for Linear Constraint Solving: Its Incorporation in a Prolog Meta-Interpreter for CLP
TLDR
This paper presents an incremental and efficient algorithm for testing the satisfiability of systems of linear equalities, inequalities (strict or unrestricted), and disequalities in the domain of rationals. Expand
  • 13
  • 2