 |
Essentials of Programming Languages, 3rd Edition |
 |
Essentials of Programming Languages - 2nd Edition |
 |
Induction, Recursion and Programming |
 |
Induction, Recursion, and Programming |
 |
VLISP: A Verified Implementation of Scheme |
 |
Algebraic theories and tree rewriting systems (Technical report - Indiana University, Computer Science Dept) |
 |
Automatic dimensional analysis (Technical report) |
 |
Classes as syntactic sugar (Technical report - Indiana University, Computer Science Department) |
 |
Compiling Lambda expressions using continuations (Technical report - Indiana University. Computer Science Dept) |
 |
A concrete approach to abstract recursive definitions (AI memo) |
 |
Continuation-based multiprocessing (Technical report / Computer Science Dept., Indiana University) |
 |
Continuation-based program transformation strategies (Technical report - Indiana University, Computer Science Department) |
 |
Deriving target code as a representation of continuation semantics (Technical report / Computer Science Dept., Indiana University) |
 |
Different advice on structuring compilers and proving them correct (Technical report / Computer Science Dept., Indiana University) |
 |
Efficient axioms for algebra semantics (Technical report) |
 |
Essentials of Programming Languages |
 |
Final algebra semantics and data type extensions (Technical report - Indiana University, Computer Science Department) |
 |
First-order identities as a defining language (Technical report / Computer Science Dept., Indiana University) |
 |
Fixed-point constructions in order-enriched categories (Technical report - Indiana University. Computer Science Dept) |
 |
Lectures on induction and recursion (Technical report - Indiana University. Computer Science Dept) |
 |
A new incompleteness result for Hoare's system (Technical report - Indiana University, Computer Science Department) |
 |
Realizing data structures as lattices (Technical report - Indiana University. Computer Science Dept) |
 |
SCHEME 3.1 reference manual (Technical report / Computer Science Dept., Indiana University) |
 |
A semantic algebra for logic programming (Technical report / Computer Science Dept., Indiana University) |
 |
A short proof of the lexical addressing algorithm (Technical report) |
 |
Specifications, models, and implementations of data abstractions (Technical report / Computer Science Dept., Indiana University) |
 |
The frame model of computation (Technical report - Indiana University, Computer Science Department) |
 |
The register-closure abstract machine: A machine model for CPS compiling (Technical report) |
 |
Type inference for objects with instance variables and inheritance (Technical report) |
« RSS Feeds