<--- Back to Details
First PageDocument Content
Software engineering / Computer programming / Computing / Functional languages / Type theory / Data types / Procedural programming languages / ATS / Object-oriented programming / ML / Polymorphism / OCaml
Date: 2005-11-01 11:55:41
Software engineering
Computer programming
Computing
Functional languages
Type theory
Data types
Procedural programming languages
ATS
Object-oriented programming
ML
Polymorphism
OCaml

Combining Programming with Theorem Proving Chiyan Chen and

Add to Reading List

Source URL: www.cs.bu.edu

Download Document from Source Website

File Size: 225,46 KB

Share Document on Facebook

Similar Documents

ActiveRDF: Object-Oriented Semantic Web Programming Eyal Oren Renaud Delbru Sebastian Gerke

DocID: 1vfEO - View Document

www.oracle.com/academy Java Foundations – Course Description Overview This course of study engages students with little programming experience. Students are introduced to object-oriented concepts, terminology, and syn

DocID: 1uOTT - View Document

Should I take CS 210X or CS 2102? CS 210X (Accelerated Object-Oriented Design Concepts) will assume a higher degree of proficiency both in programming in general and in Java in particular compared to CSObject-Orie

DocID: 1uhH8 - View Document

core programming Basic Object-Oriented Programming in Java 1

DocID: 1uaU4 - View Document

Worlds: Controlling the Scope of Side Effects Alessandro Warth, Yoshiki Ohshima, Ted Kaehler, and Alan Kay To appear in the proceedings of the European Conference on Object-Oriented Programming, 2011. This document supe

DocID: 1u3Tg - View Document