Google
 

Programming Language Theory

Introduction to Programming Languages

Lessons:

1. Introduction to Programming Languages
2. Identifiers
3. Assignment
4. Expressions
5. Boolean Expressions
6. Data Types
7. Control Structures
1. Selection
2. Loops
3. Subprograms
4. Parameters
8. Input/Output
9. Programs
10. Summary

Implementing Functional Languages: A Tutorial ©1992 (Simon Peyton Jones/David Lester)

The principal content of the book is a series of implementations of a small functional language called the Core language. The Core language is designed to be as small as possible, so that it is easy to implement, but still rich enough to allow modern non-strict functional languages to be translated into it without losing efficiency. It is described in detail in Chapter 1, in which we also develop a parser and pretty-printer for the Core language.

Appendix B contains a selection of Core-language programs for use as test programs thoughout the book.

How Language Works (Mike Gasser)

Contents
1

Introduction
1.1        Organization and conventions in the book
1.2     What we study
1.3     How we study language
1.4     What we don't do: prescribing and evaluating language
1.5     Dialects and languages
1.6     Two themes
1.7     Why study language
1.8     Problems
2

Word meanings
2.1     Reference and proper nouns
2.2     Categories and common nouns
2.3     Word senses and taxonomies
2.4     Metaphor and metonymy

Advanced Programming Language Features for Executable Design Patterns

Table of Contents

1 Introduction
11 Reflection                                         
111 Reflection via Expressed Values (“Firstclassedness”)              
112 Reflection via Language Internals                        
2 GLOS (Greg’s Little Object System) 4
21 GLOS Types                                       
22 Methods and Generic Functions                             

Syndicate content