Programming with sets; an introduction to SETL
Programming with sets; an introduction to SETL
IEEE Computer Graphics and Applications
The Z notation: a reference manual
The Z notation: a reference manual
A random binary tree generator
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Fast set operations using treaps
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
The Mathematica book (4th edition)
The Mathematica book (4th edition)
What can we do about the unnecessary diversity of notation for syntactic definitions?
Communications of the ACM
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs
C++ Standard Template Library
Canonical Form for Rational Exponential Expressions
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Prolog - the language and its implementation compared with Lisp
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs
IEEE Transactions on Computers
Valgrind: a framework for heavyweight dynamic binary instrumentation
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
SPaC: a symbolic pareto calculator
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Pinned to the walls: impact of packaging and application properties on the memory and power walls
Proceedings of the 17th IEEE/ACM international symposium on Low-power electronics and design
| Hi-index | 0.00 |
Presented is the design, implementation and evaluation of a system for computing with non-enumerative set representations. The implementation is in the form of a set assembly language (Sal) whose operations correspond to an implementation of the algebra of sets, with minimal added syntactic sugar; a compiler (Salc) for validation and static optimization of Sal definitions; and a virtual machine architecture (Svm) for executing Sal definitions. Sal/Svm has turned out to be a surprisingly versatile framework for a growing number of problems. One such application, as a framework for declaratively specifying computational problems with the same level of precision that traditional machine languages enable the specification of computational algorithms, is presented.