Jump to content

User:Jmcgarey/Books/Programming Language Theory

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jmcgarey (talk | contribs) at 23:10, 9 May 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.


Programming Language Theory

Programming language theory
Abstract syntax
Divergence (computer science)
First-class function
Function-level programming
Higher-order abstract syntax
Logic error
Logic of Computable Functions
Non-local variable
POPLmark challenge
Programming Computable Functions
Proof-carrying code
Qualification principle
Referential transparency
Semantic error
Side effect (computer science)
Structured program theorem
Syntax error
Turing completeness
Typed assembly language
Variadic
List of programming language researchers
Frances E. Allen
Andrew Appel
John Backus
Henry Baker (computer scientist)
Mordechai Ben-Ari
Rudolf Berghammer
Richard Bird (computer scientist)
Per Brinch Hansen
Jim Brown (computer scientist)
Luca Cardelli
Craig Chambers
James Cordy
Patrick Cousot
Radhia Cousot
Olivier Danvy
Frederica Darema
Christophe de Dinechin
Edsger W. Dijkstra
R. Kent Dybvig
Andrey Ershov
Richard Fateman
Matthias Felleisen
Wally Feurzeig
Robert Bruce Findler
Matthew Flatt
Michael Franz
Daniel P. Friedman
Carlo Ghezzi
Andrew D. Gordon
Susan L. Graham
Bernard Greenberg
David Gries
Charles Leonard Hamblin
Robert Harper (computer scientist)
Anders Hejlsberg
Tony Hoare
Paul Hudak
John Hughes (computer scientist)
Jean Ichbiah
Gregor Kiczales
Shriram Krishnamurthi
Monica S. Lam
Peter Landin
Xavier Leroy
Karl Lieberherr
Barbara Liskov
Harry Mairson
Erik Meijer (computer scientist)
Bertrand Meyer
Robin Milner
John C. Mitchell
David Moon
Roger Moore (computer scientist)
Greg Morrisett
Ike Nassi
George Necula
Oscar Nierstrasz
Kristen Nygaard
Martin Odersky
Richard O'Keefe
Simon Peyton Jones
Frank Pfenning
Benjamin C. Pierce
Gordon Plotkin
Amir Pnueli
Thomas W. Reps
John C. Reynolds
Peter H. Salus
Klaus Samelson
David Sayre
Gunther Schmidt
Dana Scott
Michael Spivey
George Springer (mathematician)
Guy L. Steele, Jr.
Joe Stoy
Christopher Strachey
Don Syme
Cynbe ru Taren
Tim Teitelbaum
David Turner (computer scientist)
Philip Wadler
John Wainwright (computer scientist)
Mitchell Wand
Peter Wegner
Richard Wexelblat
Niklaus Wirth
Stephen Wolfram
Absys
ALGOL 60
ALGOL 68
BitC
Charity (programming language)
CLU (programming language)
Curry (programming language)
FL (programming language)
FP (programming language)
FX-87
Haskell (programming language)
Hope (programming language)
ISWIM
Joy (programming language)
Lisp (programming language)
Lucid (programming language)
ML (programming language)
NPL (programming language)
OBJ (programming language)
Object-Oriented Turing
P′′
PAL (programming language)
Parlog
Pascal (programming language)
Racket (programming language)
SASL (programming language)
Scheme (programming language)
SETL
Turing (programming language)
Turing+
Call-with-current-continuation
Document Style Semantics and Specification Language
GNU Guile
History of the Scheme programming language
Hygienic macro
PreScheme
ProgramByDesign
Scheme Requests for Implementation
SLIB
SLIME
Structure and Interpretation of Computer Programs
The Structure and Interpretation of the Computer Science Curriculum
SXML
T (programming language)
Tail call
Tail recursion
Teach Yourself Scheme in Fixnum Days
Advice taker
Alphard (programming language)
AmbientTalk
Lagoona (programming language)
Lava (programming language)
Lithe (programming language)
MacroML
Moby (programming language)
Pict (programming language)
Subtext (programming language)
UNITY (programming language)
Whiley (programming language)
Lambda calculus
Anonymous function
Applicative computing systems
Apply
B, C, K, W system
Beta normal form
Binary lambda calculus
Böhm tree
Calculus of constructions
Call-by-push-value
Cartesian closed category
Church encoding
Church–Rosser theorem
Combinatory logic
Context change potential
Currying
De Bruijn index
De Bruijn notation
Deductive lambda calculus
Director string
Explicit substitution
Fixed-point combinator
Higher-order function
Hindley–Milner type system
Kleene–Rosser paradox
Knights of the Lambda Calculus
Lambda calculus definition
Lambda cube
Lambda lifting
Lambda-mu calculus
Let expression
Mogensen–Scott encoding
Montague grammar
Normalisation by evaluation
Normalization property (abstract rewriting)
Pattern calculus
Pure type system
Reduction strategy (lambda calculus)
Rho calculus
Simply typed lambda calculus
SKI combinator calculus
Supercombinator
System F
System F-sub
System U
Type inhabitation
Typed lambda calculus
Untyped lambda calculus
Η-conversion
SECD machine
Applicative programming language
Applicative Universal Grammar
Categorical abstract machine
Graph reduction machine
Substitution (logic)
Capture-avoiding substitution
Abstract rewriting system
Buchberger's algorithm
Canonical rewriting system
Confluence (abstract rewriting)
Congruence closure
Convergence (logic)
Critical pair (logic)
Dershowitz–Manna ordering
Encompassment ordering
Gröbner basis
Jean-Pierre Jouannaud
Knuth–Bendix completion algorithm
Markov algorithm
Newman's lemma
Normal form (abstract rewriting)
Orthogonality (term rewriting)
Overlap (term rewriting)
Path ordering (term rewriting)
Reduction (abstract rewriting)
Reduction ordering
Reduction strategy (code optimization)
Reflexive closure
Rewrite order
Rewriting
Semi-Thue system
Symmetric closure
Term (logic)
Termination (term rewriting)
Unification (computer science)
Word problem (mathematics)
Double pushout graph rewriting
Graph reduction
Graph rewriting
GReAT
GrGen
Tom (pattern matching language)
VIATRA
Abstract rewriting machine
Adenine (programming language)
ASF+SDF Meta Environment
Maude system
Pure (programming language)
Q (equational programming language)
RascalMPL
Refal
Stratego/XT
Wolfram Language