Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
A first report on the A# compiler
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithm-oriented generic libraries
Software—Practice & Experience
Simple and effective link-time optimization of Modula-3 programs
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
A Tree-Based Alternative to Java Byte-Codes
International Journal of Parallel Programming
Operators and algebraic structures
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
Algebraic algorithm descriptions as programs
ACM SIGSAM Bulletin
Evaluation of a Java Computer Algebra System
Computer Mathematics
Generic, type-safe and object oriented computer algebra software
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Unique factorization domains in the java computer algebra system
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
Compiler-enforced memory semantics in the SACLIB computer algebra library
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |
This paper introduces SUCHTHAT, a language for experiments in generic programming. SUCHTHAT forms the synthesis of two independently developed languages: Aldes, a language for algorithm descriptions, and TECTON, a specification language for generic components. The SUCHTHAT language is characterized by its support of algorithmic requirements and dependent genericity. We discuss the underlying design decisions and show that the semantic interpretation of overloading plays a key role in determining optimal instantiations.