Efficient nondestructive equality checking for trees and graphs
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Htdp and dmda in the battlefield: a case study in first-year programming instruction
Proceedings of the 2008 international workshop on Functional and declarative programming in education
Self-Sustaining Systems
α lean TAP: A Declarative Theorem Prover for First-Order Classical Logic
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Celebrating the 50th Anniversary of Lisp
Revised6 report on the algorithmic language scheme
Journal of Functional Programming
Science of Computer Programming
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
ABI compatibility through a customizable language
GPCE '10 Proceedings of the ninth international conference on Generative programming and component engineering
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Abstracting abstract machines: a systematic approach to higher-order program analysis
Communications of the ACM
WeScheme: the browser is your programming environment
Proceedings of the 16th annual joint conference on Innovation and technology in computer science education
Pushdown flow analysis of first-class control
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A semantics for context-sensitive reduction semantics
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Remedying the eval that men do
Proceedings of the 2012 International Symposium on Software Testing and Analysis
Honu: syntactic extension for algebraic notation through enforestation
Proceedings of the 11th International Conference on Generative Programming and Component Engineering
Strong reduction for typed lambda calculus with first-class environments
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Submodules in racket: you want it when, again?
Proceedings of the 12th international conference on Generative programming: concepts & experiences
| Hi-index | 0.02 |
Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary. Scheme demonstrates that a very small number of rules for forming expressions, with no restrictions on how they are composed, are enough to form a practical and efficient programming language that is flexible enough to support most of the major programming paradigms in use today. This book contains the three parts comprising 'R6RS', the sixth revision of a series of reports describing the programming language Scheme. The book is divided into parts: a description of the language itself, a description of the standard libraries and non-normative appendices. Early chapters introduce Scheme and later chapters act as a reference manual. This is an important report for programmers that work with or want to learn about the Scheme language.