A language for generic programming in the large
From MaRDI portal
Publication:532409
DOI10.1016/j.scico.2008.09.009zbMath1217.68050OpenAlexW2063477581MaRDI QIDQ532409
Andrew Lumsdaine, Jeremy G. Siek
Publication date: 4 May 2011
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2008.09.009
genericspolymorphismfunctorssignaturessoftware reuseassociated typesgeneric programmingprogramming language designreusable software librariestype classesvirtual types
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- Region-based memory management
- Polymorphic type inference and containment
- A theory of type polymorphism in programming
- The subtyping problem for second-order types is undecidable.
- Associated type synonyms
- Modular type classes
- On a routing problem
- Practical type inference for arbitrary-rank types
- Fast Decision Procedures Based on Congruence Closure
- Variations on the Common Subexpression Problem
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Abstraction mechanisms in CLU
- Qualified Types
- ML F
- Associated types with class
- An extended comparative study of language support for generic programming
- On sentences which are true of direct unions of algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item