<--- Back to Details
First PageDocument Content
Computing / Data types / Procedural programming languages / Object-oriented programming / Functional languages / Type system / Type inference / Generic programming / Subtype polymorphism / Software engineering / Type theory / Programming language theory
Date: 2012-09-05 20:22:17
Computing
Data types
Procedural programming languages
Object-oriented programming
Functional languages
Type system
Type inference
Generic programming
Subtype polymorphism
Software engineering
Type theory
Programming language theory

Add to Reading List

Source URL: adam.chlipala.net

Download Document from Source Website

File Size: 265,48 KB

Share Document on Facebook

Similar Documents

A Semismooth Newton Method for Fast, Generic Convex Programming Alnur Ali * 1 Eric Wong * 1 J. Zico Kolter 2 i.e., the space of m × m positive semidefinite matrices Sm +, yields a semidefinite program; and taking K as

DocID: 1uDDW - View Document

Concepts: Linguistic Support for Generic Programming in C++ Douglas Gregor Jaakko J¨arvi Jeremy Siek

DocID: 1uj6o - View Document

COMP2145 –Generic Second Year Programming

DocID: 1u4HX - View Document

Generic Programming for Indexed Datatypes José Pedro Magalhães1 Johan Jeuring1,2 1 Department

DocID: 1tK26 - View Document

Supplement to “A Semismooth Newton Method for Fast, Generic Convex Programming” Alnur Ali * 1 Eric Wong * 1 J. Zico Kolter 2 This document contains proofs and supplementary details for the paper “A Semismooth Newt

DocID: 1tJkx - View Document