A coordinate-free approach to geometric programming
Theory and practice of geometric modeling
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A computational basis for higher-dimensional computational geometry and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Generative programming: methods, tools, and applications
Generative programming: methods, tools, and applications
Geometric methods and applications: for computer science and engineering
Geometric methods and applications: for computer science and engineering
MetaML and multi-stage programming with explicit annotations
Theoretical Computer Science - Partial evaluation and semantics-based program manipulation
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
On the algebraic and geometric foundations of computer graphics
ACM Transactions on Graphics (TOG)
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modeling 3D Euclidean Geometry
IEEE Computer Graphics and Applications
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
Generative Programming and Active Libraries
Selected Papers from the International Seminar on Generic Programming
Commonality Analysis: A Systematic Process for Defining Families
Proceedings of the Second International ESPRIT ARES Workshop on Development and Evolution of Software Architectures for Product Families
Implementing the XYZ GeoBench: A Programming Environment for Geometric Algorithms
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
A system for the solution of initial and two-point boundary value problems
ACM '72 Proceedings of the ACM annual conference - Volume 2
Geometric Tools for Computer Graphics
Geometric Tools for Computer Graphics
Multistage programming: its theory and applications
Multistage programming: its theory and applications
A methodology for generating verified combinatorial circuits
Proceedings of the 4th ACM international conference on Embedded software
Semi-formal design of reliable mesh generation systems
Advances in Engineering Software
Gaussian elimination: a case study in efficient genericity with MetaOCaml
Science of Computer Programming - Special issue on the first MetaOCaml workshop 2004
In search of a program generator to implement generic transformations for high-performance computing
Science of Computer Programming - Special issue on the first MetaOCaml workshop 2004
Mesh Generation: Application to Finite Elements
Mesh Generation: Application to Finite Elements
Coordinate free programming of computational fluid dynamics problems
Scientific Programming
On the Design and Development of Program Families
IEEE Transactions on Software Engineering
Accomplishments and research challenges in meta-programming
SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code
Science of Computer Programming
Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
| Hi-index | 0.00 |
We present the design and implementation of a generative geometric kernel. The kernel generator is generic, type-safe, parametrized by many design-level choices and extensible. The resulting code has minimal traces of the design abstractions. We achieve genericity through a layered design deriving concepts from affine geometry, linear algebra and abstract algebra. We achieve parametrization and type-safety by using OCaml's module system, including higher order modules. The cost of abstraction is removed by using MetaOCaml's support for code generation coupled with some annotations atop the code type.