Nested Data Parallelism

Rule Induction

Statics

Gödel's T and PCF

Recursive Types

Dynamic Languages as Typed Languages

Assignable References

Evaluation Dynamics

Control Stacks

Futures and Speculations

Judgments as Types

Dynamics

Function (computer programming)

Products and Sums

Dynamic Languages

Scoped Assignables

Representation Independence

Monads

Proofs as Programs

Binding

Abstract Syntax

Substitution Lemma

Objects and Dynamic Dispatch

Church's λ-Calculus

System F

Cost Dynamics

Brent's Theorem

Communication in the π-calculus

Dependently Typed Programming

Substitution (logic)

De Bruijn Indices

Definability and undefinability

Proof Techniques

Modernized Algol

Polymorphism (computer science)

Parallelism

Free Assignables

Concurrent Algol

15-312 Foundations of Programming Languages Carnegie Mellon University Spring 2014 A comprehensive course at Carnegie Mellon University that introduces fundamental principles of programming language design and implementation from a mathematical perspective. It delves deep into the structural and dynamic aspects of programming languages, studying concepts like recursion, objects, polymorphism, and parallelism. This course introduces the fundamental principles of programming language design, semantics, and implementation. Our goal is to examine the fundamental structure of programming languages from a mathematical perspective.   

15-312 Foundations of Programming Languages

Programming Languages

Nested Data Parallelism

1 courses cover this concept

15-312 Foundations of Programming Languages