Essential language support for generic programming

Essential language support for generic programming (2005)

by Jeremy Siek , Andrew Lumsdaine

Venue:	In PLDI ’05
Citations:	26 - 4 self

Datum	Value	Source
TITLE	Essential language support for generic programming	INFERENCE
AUTHOR NAME	Jeremy Siek	SVM HeaderParse 0.2
AUTHOR NAME	Andrew Lumsdaine	SVM HeaderParse 0.2
ABSTRACT	“Concepts ” are an essential language feature needed to support generic programming in the large. Concepts allow for succinct expression of bounds on type parameters of generic algorithms, enable systematic organization of problem domain abstractions, and make generic algorithms easier to use. In this paper we formalize the design of a type system and semantics for concepts that is suitable for non-type-inferencing languages. Our design shares much in common with the type classes of Haskell, though our primary influence is from best practices in the C ++ community, where concepts are used to document type requirements for templates in generic libraries. The technical development in this paper defines an extension to System F and a type-directed translation from the extension back to System F. The translation is proved sound; the proof is written in the human readable but machine checkable Isar language and has been automatically verified by the Isabelle proof assistant. This document was generated directly from the Isar theory files using Isabelle’s support for literate proofs.	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	In PLDI ’05	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	73--84	INFERENCE
CITATIONS	49 found	ParsCit 1.0