Programming board?

Is there any programming discussion happening here? SICP, HtDP, tAoCP, G4, LISP, ..?

# Program to generate a random number between 0 and 9

# importing the random module
import random

print(random.randint(0,9))

10 PRINT "YOU ARE A FAG"
20 GOTO 10

We are now discussing computer science. Show that x(t+1)=x(t)/2 approaches 0 very fast.

PRINT AN ISSUE OF PROGRIDER

https://news.ycombinator.com/item?id=31491479 -- Kook? Not kook?

>>6
Looks like any other URL to me.

>>5
Would that be a zine? Would you photocopy it at Kinko's?

Maybe we can start a club and snail mail SSDs around.

>>4
inf/2 = inf

>>9
Of course, it is assumed x(0) is a real number.

>>1
TAPL is better

The Anus programming language?

>>10
Infinity is a real number.

The only real number is the dubs constant, a crucial idea in the pumblenut theorem.

>>13
Not really. The reals are defined as a complete ordered field. That means in particular that every real number x different from zero has an additive inverse -x such that x+(-x)=0. But infinity + (-infinity) is indeterminate.

>>12
https://www.cis.upenn.edu/~bcpierce/tapl/
Types and Programming Languages
Benjamin C. Pierce

The MIT Press
Massachusetts Institute of Technology
Cambridge, Massachusetts 02142
http://mitpress.mit.edu
ISBN 0-262-16209-1

A type system is a syntactic method for enforcing levels of abstraction in programs. The study of type systems--and of programming languages from a type-theoretic perspective--has important applications in software engineering, language design, high-performance compilers, and security.

This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.

The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages. (The full table of contents is available here.)

Benjamin C. Pierce is Professor of Computer and Information Science at the University of Pennsylvania.